Author:
Avis David,Katoh Naoki,Ohsaki Makoto,Streinu Ileana,Tanigawa Shin-ichi
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference25 articles.
1. Aichholzer, O., Aurenhammer, F., Huemer, C., Vogtenhuber, B.: Gray code enumeration of plane straight-line graphs. In: Proc. 22th European Workshop on Computational Geometry (EuroCG ’06), pp. 71–74, Greece, 2006
2. Anglada, M.V.: An improved incremental algorithm for constructing restricted Delaunay triangulations. Comput. Graph. 21(2), 215–223 (1997)
3. Avis, D., Fukuda, K.: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput. Geom. 8, 295–313 (1992)
4. Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65(1-3), 21–46 (1996)
5. Avis, D., Katoh, N., Ohsaki, M., Streinu, I., Tanigawa, S.: Enumerating non-crossing minimally rigid frameworks. Graphs Comb. 23(Suppl.), 117–134 (2007)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献