Grid embedding of 4-connected plane graphs

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1027)


A straight line grid embedding of a plane graph G is a drawing of G such that the vertices are drawn at grid points and the edges are drawn as non-intersecting straight line segments. In this paper, we show that, if a 4-connected plane graph G has at least 4 vertices on its exterior face, then G can be embedded on a grid of size W×H such that W+H≤n, W≤(n+3)/2 and H≤2(n−1)/3, where n is the number of vertices of G. Such an embedding can be computed in linear time.


  1. 1.
    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.), 1982, pp.153–173.Google Scholar
  2. 2.
    M. Chrobak and G. Kant, Convex grid drawings of 3-connected planar graphs, Tech. Rep. RUU-CS-93-45, Dept. of Comp. Sci. Utrecht University, 1993.Google Scholar
  3. 3.
    M. Chrobak and S. Nakano, Minimum-width grid drawings of planar graphs, in Proc. Workshop on Graph Drawing'94, Princeton, NJ, Oct. 1994.Google Scholar
  4. 4.
    M. Chrobak and T. Payne, A linear time algorithm for drawing planar graphs on a grid, TR UCR-CS-89-1, Dept. of Math. and Comp. Sci., UC at Riverside, 1989.Google Scholar
  5. 5.
    G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Comput. Goem. Theory Appl. Vol 4, 1994, pp. 235–282.Google Scholar
  6. 6.
    I. Fáry, On straight line representation of planar graphs, Acta. Sci. Math. Szeged, 11, 1948, pp. 229–233.Google Scholar
  7. 7.
    H. de Fraysseix, J. Pach and R. Pollack, How to draw a planar graph on a grid, Combinatorica 10, 1990, pp. 41–51.CrossRefGoogle Scholar
  8. 8.
    M. Fürer, X. He, M. Y. Kao, and B. Raghavachari, O(n log log n)-work parallel algorithms for straight line grid embeddings of planar graphs, SIAM J. Disc. Math 7(4), 1994, pp. 632–647.CrossRefGoogle Scholar
  9. 9.
    G. Kant, Drawing planar graphs using the lmc-ordering, in Proc. 33th Ann. IEEE Symp. on Found. of Comp. Science, Pittsburgh, 1992, pp. 101–110.Google Scholar
  10. 10.
    G. Kant and X. He, Two algorithms for finding rectangular duals of planar graphs, in Proc. 19th on Graph-Theoretic Concepts in CS, 1993, LNCS 790, pp. 396–410.Google Scholar
  11. 11.
    F. Preparata and R. Tamassia, Fully dynamic techniques for point location and transitive closure in planar structures, in Proc. 29th FOCS, 1988, pp. 558–567.Google Scholar
  12. 12.
    P. Rosenstiehl and R. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discrete & Computational Geometry 1, 1986, pp. 343–353.Google Scholar
  13. 13.
    W. Schnyder, Embedding planar graphs on the grid, Abs. AMS 9, 1988, p. 268.Google Scholar
  14. 14.
    W. Schnyder, Planar graphs and poset dimension, Orders 5, 1989, pp. 323–343.CrossRefGoogle Scholar
  15. 15.
    W. Schnyder, Embedding planar graphs on the grid, in Proc. of the 1st Annual ACM-SIAM Symp. on Discrete Algorithms, 1990, pp. 138–147.Google Scholar
  16. 16.
    W. Schneider and W. Trotter, Convex drawings of planar graphs, Abstracts of AMS 13 (5), 1992.Google Scholar
  17. 17.
    S. K. Stein, Convex maps, in Proc Amer Math Soc, Vol. 2, 1951, pp. 464–466.Google Scholar
  18. 18.
    W. T. Tutte, How to draw a graph, Proc. London Math. Soc. 13, 1963, pp. 743–768.Google Scholar
  19. 19.
    K. Wagner, Bemerkungen zum Vierfarben problem, Jahresbericht Deutsch Math 46, 1936, pp. 26–32.Google Scholar

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Xin He
    • 1
  1. 1.Department of Computer ScienceState University of New York at BuffaloBuffalo

Personalised recommendations