Generating All Triangulations of Plane Graphs

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 each face (a cycle) of the graph. We give an algorithm to generate all triangulations of a cycle C of n vertices in time O(1) per triangulation, where the vertices of C are numbered. Finally, we give an algorithm for generating all triangulations of a cycle C of n vertices in time O(n 2 ) per triangulation,

[1]  Marc Noy,et al.  Graph of triangulations of a convex polygon and tree of triangulations , 1999, Comput. Geom..

[2]  Md. Saidur Rahman,et al.  Planar Graph Drawing , 2004, Lecture Notes Series on Computing.

[3]  Sadiq M. Sait,et al.  VLSI Physical Design Automation - Theory and Practice , 1995, Lecture Notes Series on Computing.

[4]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[5]  Sergei Bespamyatnikh,et al.  An efficient algorithm for enumeration of triangulations , 2002 .

[6]  Shin-Ichi Nakano,et al.  Generating All Triangulations of Plane Graphs (Extended Abstract) , 2009, WALCOM.

[7]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

[8]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[9]  Robert E. Tarjan,et al.  Rotation distance, triangulations, and hyperbolic geometry , 1986, STOC '86.

[10]  Shin-Ichi Nakano,et al.  Efficient Generation of Plane Triangulations without Repetitions , 2001, ICALP.

[11]  Seiya Negami,et al.  Diagonal Flips in Triangulations on Closed Surfaces with Minimum Degree at Least 4 , 1999, J. Comb. Theory, Ser. B.

[12]  Brendan D. McKay,et al.  Isomorph-Free Exhaustive Generation , 1998, J. Algorithms.

[13]  David Avis,et al.  Generating rooted triangulations without repetitions , 1996, Algorithmica.

[14]  David Avis,et al.  Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[15]  Dominique Poulalhon,et al.  Optimal Coding and Sampling of Triangulations , 2003, Algorithmica.

[16]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .