Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)
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)
Zhang, H., He, X.: Canonical ordering tree and its applications in graph drawing (2003)
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)
Krug, M.: Minimizing the area for planar straight-line grid drawings. Master’s thesis, Universität Karlsruhe (2007)
Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krug, M., Wagner, D. (2008). Minimizing the Area for Planar Straight-Line Grid Drawings. In: Hong, SH., Nishizeki, T., Quan, W. (eds) Graph Drawing. GD 2007. Lecture Notes in Computer Science, vol 4875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77537-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-77537-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77536-2
Online ISBN: 978-3-540-77537-9
eBook Packages: Computer ScienceComputer Science (R0)