Grid Drawings of Four-Connected Plane Graphs
A grid drawing of a plane graph G is a drawing of G on the plane so that all vertices of G are put on plane grid points and all edges are drawn as straight line segments between their endpoints without any edge-intersection. In this paper we give a very simple algorithm to find a grid drawing of any given 4-connected plane graph G with four or more vertices on the outer face. The algorithm takes time O(n) and needs a rectangular grid of width ⌈n/2⌉-1 and height ⌈n/2⌉ if G has n vertices. The algorithm is best possible in the sense that there are an infinite number of 4-connected plane graphs any grid drawings of which need rectangular grids of width ⌈n/2⌉ - 1 and height ⌈n/⌉e.
- 2.G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing, Prentice Hall, NJ (1998).Google Scholar
- 7.N. Chiba, T. Yamanouchi and T. Nishizeki, Linear algorithms for convex drawings of planar graphs, in Progress in Graph Theory, J. A. Bondy and U. S. R. Murty (eds.), Academic Press, 153–173 (1984).Google Scholar
- 8.I. Fáry, On straight lines representation of plane graphs, Acta. Sci. Math. Szeged, 11, 229–233 (1948).Google Scholar
- 10.X. He, Grid embedding of 4-connected plane graphs, Discrete & Computational Geometry, 17, 339–358 (1997).Google Scholar
- 13.W. Schnyder, Embedding planar graphs on the grid, Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, San Francisco, 138–148 (1990).Google Scholar
- 16.K. Wagner, Bemerkungen zum vierfarbenproblem, Jahresbericht der Deutschen Mathematiker-Vereinigung, 46, 26–32 (1936).Google Scholar