Rectangular Drawings of Plane Graphs Without Designated Corners
A rectangular drawing of a plane graph G is a drawing of G such that each vertex is drawn as a point, each edge is drawn as a horizontal or a vertical line segment, and the contour of each face is drawn as a rectangle. A necessary and sufficient condition for the existence of a rectangular drawing has been known only for the case where exactly four vertices of degree 2 are designated as corners in a given plane graph G. In this paper we establish a necessary and sufficient condition for the existence of a rectangular drawing of G for the general case in which no vertices are designated as corners. We also give a linear-time algorithm to find a rectangular drawing of G if it exists.
Key wordsGraph Algorithm Graph Drawing Rectangular Drawing
Unable to display preview. Download preview PDF.
- [KK84]K. Kozminski and E. Kinnen, An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits, Proc. 21st DAC, Albuquerque, June (1984), pp. 655–656.Google Scholar
- [L90]T. Lengauer, Combinatirial Algorithms for Integrated Circuit Layout, John Wiley & Sons, Chichester, 1990.Google Scholar
- [T84]C. Thomassen, Plane representations of graphs, Eds. J. A. Bondy and U. S. R. Murty, Progress in Graph Theory, Academic Press Canada, (1984), pp. 43–69.Google Scholar