Minimizing the Area for Planar Straight-Line Grid Drawings

  • Marcus Krug
  • Dorothea Wagner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4875)


Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid drawings. In this paper, we show that it is NP-complete to decide if a planar graph has a planar straight-line drawing on a grid of given size. Furthermore, we present a new iterative approach to compactify planar straight-line grid drawings. In an experimental study, we evaluate the quality of the compactified drawings with respect to the size of the area as well as to other measures.


  1. 1.
    de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Schnyder, W.: Embedding planar graphs on the grid. In: SODA 1990. Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, pp. 138–148 (1990)Google Scholar
  3. 3.
    Zhang, H., He, X.: Canonical ordering tree and its applications in graph drawing (2003)Google Scholar
  4. 4.
    Kramer, M., van Leeuwen, J.: The NP-completeness of finding minimum area layouts for VLSI-circuits (to appear). Technical Report RUU-CS-82-06, Institute of Information and Computing Sciences, Utrecht University (1982)Google Scholar
  5. 5.
    Krug, M.: Minimizing the area for planar straight-line grid drawings. Master’s thesis, Universität Karlsruhe (2007)Google Scholar
  6. 6.
    Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1990)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Marcus Krug
    • 1
  • Dorothea Wagner
    • 1
  1. 1.Universität Karlsruhe 

Personalised recommendations