Computing Cartograms with Optimal Complexity

In a rectilinear dual of a planar graph vertices are represented by simple rectilinear polygons, while edges are represented by side-contact between the corresponding polygons. A rectilinear dual is called a cartogram if the area of each region is equal to a pre-specified weight. The complexity of a cartogram is determined by the maximum number of corners (or sides) required for any polygon. In a series of papers the polygonal complexity of such representations for maximal planar graphs has been reduced from the initial 40 to 34, then to 12 and very recently to the currently best known 10. Here we describe a construction with 8-sided polygons, which is optimal in terms of polygonal complexity as 8-sided polygons are sometimes necessary. Specifically, we show how to compute the combinatorial structure and how to refine it into an area-universal rectangular layout in linear time. The exact cartogram can be computed from the area-universal layout with numerical iteration, or can be approximated with a hill-climbing heuristic. We also describe an alternative construction of cartograms for Hamiltonian maximal planar graphs, which allows us to directly compute the cartograms in linear time. Moreover, we prove that even for Hamiltonian graphs 8-sided rectilinear polygons are necessary, by constructing a non-trivial lower bound example. The complexity of the cartograms can be reduced to 6 if the Hamiltonian path has the extra property that it is one-legged, as in outer-planar graphs. Thus, we have optimal representations (in terms of both polygonal complexity and running time) for Hamiltonian maximal planar and maximal outer-planar graphs. Finally we address the problem of constructing small-complexity cartograms for 4-connected graphs (which are Hamiltonian). We first disprove a conjecture, posed by two set of authors, that any 4-connected maximal planar graph has a one-legged Hamiltonian cycle, thereby invalidating an attempt to achieve a polygonal complexity 6 in cartograms for this graph class. We also prove that it is NP-hard to decide whether a given 4-connected plane graph admits a cartogram with respect to a given weight function.

[1]  I Rinsma Nonexistence of a Certain Rectangular Floorplan with Specified Areas and Adjacency , 1987 .

[2]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[3]  Kai Wang,et al.  Floorplan area optimization using network analogous approach , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.

[4]  H. de Fraysseix,et al.  On topological aspects of orientations , 2001, Discret. Math..

[5]  Donald H. House,et al.  Continuous cartogram construction , 1998 .

[6]  Majid Sarrafzadeh,et al.  Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules , 1993, SIAM J. Comput..

[7]  Waldo R. Tobler Thirty Five Years of Computer Cartograms , 2004 .

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

[9]  Therese C. Biedl,et al.  Complexity of Octagonal and Rectangular Cartograms , 2005, CCCG.

[10]  E. Rosenberg,et al.  Optimal module sizing in VLSI floorplanning by nonlinear programming , 1989, ZOR Methods Model. Oper. Res..

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

[12]  Stefan Felsner,et al.  Proportional Contact Representations of Planar Graphs , 2011, Graph Drawing.

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

[14]  Yen-Tai Lai,et al.  An Algorithm for Building Rectangular Floor-Plans , 1984, 21st Design Automation Conference Proceedings.

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

[16]  Patrice Ossona de Mendez,et al.  On Triangle Contact Graphs , 1994, Combinatorics, Probability and Computing.

[17]  Atsushi Takahashi,et al.  Air-Pressure Model and Fast Algorithms for Zero-Wasted-Area Layout of General Floorplan(Special Section on Discrete Mathematics and Its Applications) , 1998 .

[18]  Bettina Speckmann,et al.  On rectilinear duals for vertex-weighted plane graphs , 2009, Discret. Math..

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

[20]  Michael Kaufmann,et al.  Optimal Polygonal Representation of Planar Graphs , 2011, Algorithmica.

[21]  Stefan Felsner,et al.  Computing cartograms with optimal complexity , 2012, SoCG '12.

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

[23]  Israel Koren,et al.  Floorplans, planar graphs and layouts , 1988 .

[24]  Xin He,et al.  On Floor-Plan of Plane Graphs , 1999, SIAM J. Comput..

[25]  Martin Nöllenburg,et al.  Edge-Weighted Contact Representations of Planar Graphs , 2012, Graph Drawing.

[26]  Marek Chrobak,et al.  A Linear-Time Algorithm for Drawing a Planar Graph on a Grid , 1995, Inf. Process. Lett..

[27]  Daniel A. Keim,et al.  RecMap: Rectangular Map Approximations , 2004 .

[28]  S. Hakimi,et al.  Globally optimal floorplanning for a layout problem , 1996 .

[29]  Stefan Felsner,et al.  Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations , 2011, ISAAC.

[30]  Stephen G. Kobourov,et al.  Proportional Contact Representations of 4-Connected Planar Graphs , 2012, Graph Drawing.

[31]  Therese C. Biedl,et al.  Orthogonal Cartograms with Few Corners Per Face , 2011, WADS.

[32]  Hiroshi Nagamochi,et al.  Orthogonal Drawings for Plane Graphs with Specified Face Areas , 2007, TAMC.

[33]  Michael K. H. Fan,et al.  On convex formulation of the floorplan area minimization problem , 1998, ISPD '98.

[34]  Jeremy J. Michalek,et al.  Architectural layout design optimization , 2002 .

[35]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

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

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

[38]  I. Cederbaum,et al.  Analogy between VLSI floorplanning problems and realisation of a resistive network , 1992 .

[39]  Bettina Speckmann,et al.  Optimal BSPs and Rectilinear Cartograms , 2010, Int. J. Comput. Geom. Appl..

[40]  Torsten Ueckerdt,et al.  Geometric Representations of Graphs with Low Polygonal Complexity , 2012 .