Minimizing the Area for Planar Straight-Line Grid Drawings

Krug, Marcus and Wagner, Dorothea (2008) Minimizing the Area for Planar Straight-Line Grid Drawings. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 207-212 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_21).

Full text not available from this repository.

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.

Item Type:Conference Paper
Additional Information:10.1007/978-3-540-77537-9_21
Classifications:G Algorithms and Complexity > G.070 Area / Edge Length
P Styles > P.720 Straight-line
P Styles > P.540 Planar
ID Code:839

Repository Staff Only: item control page

References

de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10 1 (1990) 41-51

Schnyder, W.: Embedding planar graphs on the grid. In: SODA '90: Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics (1990) 138-148

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, NY, USA (1990)