Generating Rooted Triangulations Without Repetitions

Algorithmica (New York)

Volumn 16, Issue 6, 1996, Pages 618-632

  Avis, D ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

2 and 3 Connected triangulations; Reverse search technique; Rooted triangulations

Indexed keywords

EID: 0001194184     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01944353     Document Type: Article

References (13)

1. D. Avis and K. Fukuda, A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra, Distrete Comput. Geom., 8 (1992), 295-313.
2. D. Avis and K. Fukuda, Reverse Search for Enumeration, Discrete Appl. Math., 6 (1996), 21-46.
3. P. Bose, T. Shermer, G. T. Toussaint, and B. Zhu, Guarding Polyhedral Terrains. Technical Report SOCS 92.20, McGill University, 1992. Comput. Geom. Theory Appl. (to appear).
4. R. Bowen and S. Fisk, Generation of Triangulations of the Sphere, Math. Comp., 21 (1967), 250-252.
5. W. G. Brown, Enumeration of Triangulations of the Disk, Proc. London Math. Soc., 14 (1964), 746-768.
6. A. Deza, K. Fukuda, and V. Rosta, Wagner's Theorem and Combinatorial Enumeration of 3-Polytopes, in RIMS Kokyuroku 872, ed. H. Imai, pp. 30-34, Kyoto University, 1994.
7. M. B. Dillencourt, Polyhedra of Small Order and Their Hamiltonian Properties, Technical Report 92-91, Information and Computer Science, University of California, Irvine, September 1992.
8. F. Hurtado, Private communication.
9. O. Ore, The Four-Color Problem. Academic Press, New York, 1967.
10. F. P. Preparata and D. E. Muller, Finding the Intersection of Two Convex Polyhedra, Theoret. Comput. Sci., 7, (1978), 217-236.
11. F. P. Preparata and M. I. Shamos, Computational Geometry, Springer-Verlag, New York, 1985.
12. W. T. Tutte, A Census of Planar Triangulations, Canad. J. Math., 14 (1962), 21-38.
13. K. Wagner, Bemerkungen zum Vierfarbenproblem, Jahresber. Deutsch. Math. -Verein., 46(1) (1936), 26-32.