# Minimum-width grid drawings of plane graphs extend abstract

## Abstract

Given a plane graph *G*, we wish to draw it in the plane, according to the given embedding, in such a way that the vertices of *G* are drawn as grid points, and the edges are drawn as straight-line segments between their endpoints. An additional objective is to minimize the size of the resulting grid. It is known that each plane graph can be drawn in such a way in a (*n*−2)×(*n*−2) grid (for *n*≥3), and that no grid smaller than (2*n*/3−1)×(2*n*/3−1) can be used for this purpose, if *n* is a multiple of 3. In fact, it can be shown that, for all *n*≥3, each dimension of the resulting grid needs to be at least [2(*n*−1)/3], even if the other one is allowed to be infinite. In this paper we show that this bound is tight, by presenting a grid drawing algorithm that produces drawings of width [2(*n*−1)/3]. The height of the produced drawings is bounded by 4[2(*n*−1)/3]−1.

## Keywords

Plane Graph External Face Shift Method Planar Embedding Contour Edge## References

- [BETT]G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis,
*Automatic graph drawing: an annotated bibliography*, to appear in Computational Geometry: Theory and Applications.Google Scholar - [CP89]M. Chrobak, T. Payne,
*A linear-time algorithm for drawing planar graphs on a grid*, Technical Report UCR-CS-89-1, Department of Mathematics and Computer Science, University of California at Riverside, 1989.Google Scholar - [CK93]M. Chrobak, G. Kant,
*Convex grid drawings of 3-connected planar graphs*, Technical Report RUU-CS-93-45, Department of Computer Science, Utrecht University, 1993.Google Scholar - [Fa48]I. Fary,
*On straight lines representation of plane graphs*, Acta. Sci. Math. Szeged 11 (1948) 229–233.Google Scholar - [FPP88]H. de Fraysseix, J. Pach, R. Pollack,
*Small sets supporting Straight-Line Embeddings of planar graphs*, Proc. 20th Annual Symposium on Theory of Computing, 1988, pp. 426–433.Google Scholar - [FPP90]H. de Fraysseix, J. Pach, R. Pollack,
*How to draw a planar graph on a grid*, Combinatorica 10 (1990) 41–51.Google Scholar - [Ka92]G. Kant,
*Drawing planar graphs using the lmc-ordering*, Proc. 33rd Symp. on Foundations of Computer Science, Pittsburgh, 1992, pp. 101–110.Google Scholar - [Ka93]G. Kant,
*Algorithms for Drawing Planar Graphs*, Ph.D. Dissertation, Department of Computer Science, University of Utrecht, 1993.Google Scholar - [Sc90]W. Schnyder,
*Embedding planar graphs in the grid*, Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, San Francisco, 1990, pp. 138–147.Google Scholar - [St51]S. K. Stein,
*Convex maps*, Proc. Amer. Math. Soc., 2 (1951) 464–466.Google Scholar - [Wa36]K. Wagner,
*Bemerkungen zum vierfarbenproblem*, Jahresbericht der Deutschen Mathematiker-Vereinigung, 46 (1936) 26–32.Google Scholar