Abstract
In this paper, we deal with the problem of generating all triangulations of plane graphs. We give an algorithm for generating all triangulations of a triconnected plane graph G of n vertices. Our algorithm establishes a tree structure among the triangulations of G, called the “tree of triangulations,” and generates each triangulation of G in O(1) time. The algorithm uses O(n) space and generates all triangulations of G without duplications. To the best of our knowledge, our algorithm is the first algorithm for generating all triangulations of a triconnected plane graph; although there exist algorithms for generating triangulated graphs with certain properties. Our algorithm for generating all triangulations of a triconnected plane graph needs to find all triangulations of a convex polygon. We give an algorithm to generate all triangulations of a convex polygon P of n vertices in time O(1) per triangulation, where the vertices of P are numbered. Our algorithm for generating all triangulations of a convex polygon also improves previous results; existing algorithms need to generate all triangulations of convex polygons of less than n vertices before generating the triangulations of a convex polygon of n vertices. Finally, we give an algorithm for generating all triangulations of a convex polygon P of n vertices in time O(n 2) per triangulation, where vertices of P are not numbered.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avis, D., Fukuda, K.: Reverse Search for Enumeration. Discrete Applied Mathematics 6, 82–90 (1996)
Bespamyatnikh, S.: An Efficient Algorithm for Enumeration of Triangulations. Comput. Geom. Theory Appl. 33, 271–279 (2002)
Chazelle, B.: Triangulating a Polygon in Linear Time. Discrete Comput. Geom. 6, 485–524 (1991)
de Berg, M., van Krevald, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2000)
Hurtado, F., Noy, M.: Graph of Triangulations of a Convex Polygon and Tree of Triangulations. Computational Geometry 13, 179–188 (1999)
Komuro, H., Nakamoto, A., Negami, S.: Diagonal Flips in Triangulations on Closed Surfaces with Minimum Degree at Least 4. Journal of Combinatorial Theory, Series B 76, 68–92 (1999)
Li, Z., Nakano, S.: Efficient Generation of Plane Triangulations without Repetitions. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 433–443. Springer, Heidelberg (2001)
Mckay, B.D.: Isomorph-free Exhaustive Generation. Journal of Algorithms 26, 306–324 (1998)
Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)
Nakano, S., Uno, T.: More Efficient Generation of Plane Triangulations. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 273–292. Springer, Heidelberg (2004)
Nakano, S., Uno, T.: Constant Time Generation of Trees with Specified Diameter. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 33–45. Springer, Heidelberg (2004)
Poulalhon, D., Schaeffer, G.: Optimal Coding and Sampling of Triangulations. Algorithmica 46, 505–527 (2006)
O’Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press, Cambridge (1998)
Sleator, D., Tarjan, R., Thurston, W.: Rotation Distance, Triangulations, and Hyperbolic Geometry. J. Amer. Math. Soc. 1, 647–681 (1988)
Sait, S.M., Youssef, H.: VLSI Physical Design Automation: Theory and Practice. World Scientific, Singapore (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parvez, M.T., Rahman, M.S., Nakano, Si. (2009). Generating All Triangulations of Plane Graphs (Extended Abstract) . In: Das, S., Uehara, R. (eds) WALCOM: Algorithms and Computation. WALCOM 2009. Lecture Notes in Computer Science, vol 5431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00202-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-00202-1_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00201-4
Online ISBN: 978-3-642-00202-1
eBook Packages: Computer ScienceComputer Science (R0)