The Flip Diameter of Rectangulations and Convex Subdivisions

We study the configuration space of rectangulations and convex subdivisions of $n$ points in the plane. It is shown that a sequence of $O(n\log n)$ elementary flip and rotate operations can transform any rectangulation to any other rectangulation on the same set of $n$ points. This bound is the best possible for some point sets, while $\Theta(n)$ operations are sufficient and necessary for others. Some of our bounds generalize to convex subdivisions of $n$ points in the plane.

[1]  Md. Saidur Rahman,et al.  Box-Rectangular Drawings of Planar Graphs , 2013, WALCOM.

[2]  Suresh Venkatasubramanian,et al.  Rectangular layouts and contact graphs , 2006, TALG.

[3]  Hsueh-I Lu,et al.  Balanced parentheses strike back , 2008, TALG.

[4]  Stephen K. Wismath,et al.  Characterizing bar line-of-sight graphs , 1985, SCG '85.

[5]  Robin Thomas,et al.  The Four-Colour Theorem , 1997, J. Comb. Theory, Ser. B.

[6]  Ron Y. Pinter,et al.  Orders Induced by Segments in Floorplans and (2 - 14 - 3, 3 - 41 - 2)-Avoiding Permutations , 2013, Electron. J. Comb..

[7]  Dorit S. Hochbaum,et al.  Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..

[8]  Raimund Seidel,et al.  A better upper bound on the number of triangulations of a planar point set , 2003, J. Comb. Theory, Ser. A.

[9]  Edwin Kinnen,et al.  Rectangular duals of planar graphs , 1985, Networks.

[10]  Teofilo F. Gonzalez,et al.  Approximation algorithms for partitioning a rectangle with interior points , 2005, Algorithmica.

[11]  Henk Meijer,et al.  Simultaneous edge flips for convex subdivisions , 2004, CCCG.

[12]  P. Pardalos,et al.  Novel Approaches to Hard Discrete Optimization , 2003 .

[13]  David Eppstein,et al.  Adjacency-preserving spatial treemaps , 2011, J. Comput. Geom..

[14]  Hsueh-I Lu,et al.  Compact floor-planning via orderly spanning trees , 2003, J. Algorithms.

[15]  Ron Y. Pinter,et al.  On the number of rectangulations of a planar point set , 2006, J. Comb. Theory A.

[16]  Greg N. Frederickson,et al.  On Linear-Time Algorithms for Five-Coloring Planar Graphs , 1984, Inf. Process. Lett..

[17]  Md. Saidur Rahman,et al.  Rectangular Drawings of Planar Graphs , 2002, Graph Drawing.

[18]  Stefan Felsner,et al.  Bijections for Baxter families and related objects , 2008, J. Comb. Theory A.

[19]  Micha Sharir,et al.  Random triangulations of planar point sets , 2006, SCG '06.

[20]  L. Moser,et al.  AN EXTREMAL PROBLEM IN GRAPH THEORY , 2001 .

[21]  M. Howard Williams.  A Linear Algorithm for Colouring Planar Graphs with Five Colours , 1985, Comput. J..

[22]  P. Erdös.  On an extremal problem in graph theory , 1970 .

[23]  Bettina Speckmann,et al.  Area-Universal and Constrained Rectangular Layouts , 2012, SIAM J. Comput..

[24]  Patrice Ossona de Mendez,et al.  A left-first search algorithm for planar graphs , 1995, Discret. Comput. Geom..

[25]  Stefan Felsner.  Exploiting Air-Pressure to Map Floorplans on Point Sets , 2013, Graph Drawing.

[26]  Stefan Felsner,et al.  Rectangle and Square Representations of Planar Graphs , 2013 .

[27]  Bettina Speckmann,et al.  On rectangular cartograms , 2007 .

[28]  Teofilo F. Gonzalez,et al.  Inproved Bounds for Rectangular and Guillotine Partitions , 1989, J. Symb. Comput..

[29]  Roberto Tamassia,et al.  A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..

[30]  Prosenjit Bose,et al.  Pattern Matching for Permutations , 1993, WADS.

[31]  Christos Levcopoulos.  Fast heuristics for minimum length rectangular partitions of polygons , 1986, SCG '86.

[32]  Ding-Zhu Du,et al.  A Tale on Guillotine Cut , 2003 .

[33]  Teofilo F. Gonzalez,et al.  Bounds for partitioning rectilinear polygons , 1985, SCG '85.

[34]  Marc Noy,et al.  Flipping Edges in Triangulations , 1999, Discret. Comput. Geom..

[35]  R. Tarjan,et al.  Rotation distance, triangulations, and hyperbolic geometry , 1986, STOC '86.

[36]  Yahya Ould Hamidoune,et al.  Representing a planar graph by vertical lines joining different levels , 1983, Discret. Math..

[37]  Bernard Chazelle,et al.  The Discrepancy Method , 1998, ISAAC.

[38]  Peter Ungar.  On Diagrams Representing Maps , 1953 .

[39]  Ronald L. Graham,et al.  Floorplan representations: Complexity and connections , 2003, TODE.

[40]  C. Lawson.  Software for C1 Surface Interpolation , 1977 .

[41]  E. Raisz.  The Rectangular Statistical Cartogram , 1934 .

[42]  Norishige Chiba,et al.  A Linear 5-Coloring Algorithm of Planar Graphs , 1981, J. Algorithms.

[43]  Cid C. de Souza,et al.  Optimal rectangular partitions , 2003, Networks.