Area-Universal and Constrained Rectangular Layouts

A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. These layouts are used as rectangular cartograms in cartography, as floorplans in building architecture and VLSI design, and as graph drawings. Often areas are associated with the rectangles of a rectangular layout and it is desirable for one rectangular layout to represent several area assignments. A layout is area-universal if any assignment of areas to rectangles can be realized by a combinatorially equivalent rectangular layout. We identify a simple necessary and sufficient condition for a rectangular layout to be area-universal: a rectangular layout is area-universal if and only if it is one-sided. We also investigate similar questions for perimeter assignments. The adjacency requirements for the rectangles of a rectangular layout can be specified in various ways, most commonly via the dual graph of the layout. We show how to find an area-universal layout for a given set of adjacency requirements whe...

[1]  Stefan Felsner,et al.  Lattice Structures from Planar Graphs , 2004, Electron. J. Comb..

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

[3]  W. Marsden.  I and J , 2012 .

[4]  G. Birkhoff.  Rings of sets , 1937 .

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

[6]  David Eppstein,et al.  Regular labelings and geometric structures , 2010, CCCG.

[7]  E Elena Mumford,et al.  Drawing graphs for cartographic applications , 2008 .

[8]  Éric Fusy,et al.  Transversal structures on triangulations: A combinatorial study and straight-line drawings , 2006, Discret. Math..

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

[10]  W.-K. Chen,et al.  Generation of rectangular duals of a planar triangulated graph by elementary transformations , 1990, IEEE International Symposium on Circuits and Systems.

[11]  Nimrod Megiddo,et al.  Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.

[12]  Éric Fusy,et al.  Transversal Structures on Triangulations, with Application to Straight-Line Drawing , 2005, GD.

[13]  I. Rinsma.  Rectangular and Orthogonal Floorplans with Required Room Areas and Tree Adjacency , 1988 .

[14]  James Gary Propp.  Generating random elements of finite distributive lattices , 1997, Electron. J. Comb..

[15]  Majid Sarrafzadeh,et al.  Sliceable Floorplanning by Graph Dualization , 1995, SIAM J. Discret. Math..

[16]  J. Propp.  Lattice structure for orientations of graphs , 2002, math/0209005.

[17]  Goos Kant,et al.  Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems , 1997, Theor. Comput. Sci..

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

[19]  G. Birkhoff,et al.  A ternary operation in distributive lattices , 1947 .

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

[21]  Jarke J. van Wijk,et al.  Squarified Treemaps , 2000, VisSym.

[22]  David Eppstein,et al.  Steinitz theorems for orthogonal polyhedra , 2009, J. Comput. Geom..

[23]  David Eppstein,et al.  Arboricity and Bipartite Subgraph Listing Algorithms , 1994, Inf. Process. Lett..

[24]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

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

[26]  Susmita Sur-Kolay,et al.  Slicible rectangular graphs and their optimal floorplans , 2001, TODE.