Abstract
We use the reverse search technique to give algorithms for generating all graphs onn points that are 2- and 3-connected planar triangulations withr points on the outer face. The triangulations are rooted, which means the outer face has a fixed labelling. The triangulations are produced without duplications inO(n 2) time per triangulation. The algorithms useO(n) space. A program for generating all 3-connected rooted triangulations based on this algorithm is available by ftp.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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.
D. Avis and K. Fukuda, Reverse Search for Enumeration,Discrete Appl. Math.,6 (1996), 21–46.
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).
R. Bowen and S. Fisk, Generation of Triangulations of the Sphere,Math. Comp.,21 (1967), 250–252.
W. G. Brown, Enumeration of Triangulations of the Disk,Proc. London Math. Soc.,14 (1964), 746–768.
A. Deza, K. Fukuda, and V. Rosta, Wagner's Theorem and Combinatorial Enumeration of 3-Polytopes, inRIMS Kokyuroku 872, ed. H. Imai, pp. 30–34, Kyoto University, 1994.
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.
F. Hurtado, Private communication.
O. Ore,The Four-Color Problem. Academic Press, New York, 1967.
F. P. Preparata and D. E. Muller, Finding the Intersection of Two Convex Polyhedra,Theoret. Comput. Sci.,7, (1978), 217–236.
F. P. Preparata and M. I. Shamos,Computational Geometry, Springer-Verlag, New York, 1985.
W. T. Tutte, A Census of Planar Triangulations,Canad. J. Math.,14 (1962), 21–38.
K. Wagner, Bemerkungen zum Vierfarbenproblem,Jahresber. Deutsch. Math.-Verein.,46(1) (1936), 26–32.
Author information
Authors and Affiliations
Additional information
Communicated by F. P. Preparata.
This research was supported by N.S.E.R.C. Grant Number A3013, F.C.A.R. Grant Number EQ1678, and a bilateral exchange from J.S.P.S./N.S.E.R.C.
Rights and permissions
About this article
Cite this article
Avis, D. Generating rooted triangulations without repetitions. Algorithmica 16, 618–632 (1996). https://doi.org/10.1007/BF01944353
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01944353