Box-Rectangular Drawings of Plane Graphs

In this paper we introduce a new drawing style of a plane graph G called a box-rectangular drawing. It is defined to be a drawing of G on an integer grid such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line segment, and the contour of each face is drawn as a rectangle. We establish a necessary and sufficient condition for the existence of a box-rectangular drawing of G. We also give a linear-time algorithm to find a box-rectangular drawing of G if it exists.

[1]  Xin He,et al.  On Finding the Rectangular Duals of Planar Triangular Graphs , 1993, SIAM J. Comput..

[2]  Sartaj Sahni,et al.  A linear algorithm to find a rectangular dual of a planar triangulated graph , 1986, 23rd ACM/IEEE Design Automation Conference.

[3]  Shin-Ichi Nakano,et al.  A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs , 1997, Graph Drawing.

[4]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[5]  Naveed A. Sherwani,et al.  Algorithms for VLSI Physical Design Automation , 1999, Springer US.

[6]  Therese C. Biedl.  Optimal Orthogonal Drawings of Triconnected Plane Graphs , 1996, SWAT.

[7]  Ioannis G. Tollis,et al.  Orthogonal Drawing of High Degree Graphs with Small Area and Few Bends , 1997, WADS.

[8]  Michael Kaufmann,et al.  Area-Efficient Static and Incremental Graph Drawings , 1997, ESA.

[9]  James A. Storer,et al.  On minimal-node-cost planar embeddings , 1984, Networks.

[10]  O. Ore.  The Four-Color Problem , 1967 .

[11]  Shin-Ichi Nakano,et al.  Rectangular grid drawings of plane graphs , 1996, Comput. Geom..

[12]  Goos Kant,et al.  2-Visibility Drawings of Planar Graphs , 1996, GD.

[13]  F. Leighton,et al.  Drawing Planar Graphs Using the Canonical Ordering , 1996 .

[14]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[15]  Shoji Shinoda,et al.  On area-efficient drawings of rectangular duals for VLSI floor-plan , 1991, Math. Program..

[16]  Rossella Petreschi,et al.  Orthogonally Drawing Cubic Graphs in Parallel , 1998, J. Parallel Distributed Comput..

[17]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[18]  Krzysztof Kozminski,et al.  An Algorithm for Finding a Rectangular Dual of a Planar Graph for Use in Area Planning for VLSI Integrated Circuits , 1984, 21st Design Automation Conference Proceedings.

[19]  Ioannis G. Tollis,et al.  Lower Bounds for Planar Orthogonal Drawings of Graphs , 1991, Inf. Process. Lett..

[20]  K. Kozminski,et al.  Rectangular dualization and rectangular dissections , 1988 .

[21]  Takao Nishizeki,et al.  Box-Rectangular Drawings of Plane Graphs (Extended Abstract) , 1999 .

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