Abstract
We show that an outerplanar graph G with n vertices and degree d admits a planar straight-line grid drawing with area O(dn 1.48) in O(n) time. This implies that if d =o(n 0.52), then G can be drawn in this fashion in o(n 2) area.
Research supported by NSF CAREER Award IIS-9985136, NSF CISE Research Infrastructure Award No. 0101244, and Mark Diamond Research Grant No. 13-Summer-2003 from GSA of The State University of New York.
Chapter PDF
Similar content being viewed by others
References
Biedl, T.: Drawing outer-planar graphs in O(n log n) area. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 54–65. Springer, Heidelberg (2002)
Chan, T.M.: A near-linear area bound for drawing binary trees. Algorithmica 34(1), 1–13 (2002)
de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)
Dujmovic, V., Wood, D.R.: Tree-partitions of k-trees with applications in graph layout. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 205–217. Springer, Heidelberg (2003)
Felsner, S., Liotta, G., Wismath, S.: Straight-line drawings on restricted integer grids in two and three dimensions. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 328–342. Springer, Heidelberg (2002)
Garg, A., Rusu, A.: Area-efficient drawings of outerplanar graphs. Technical Report No. 2003-11, Dept. Computer Sc. & Engg., Univ. at Buffalo, Buffalo (2003)
Leiserson, C.E.: Area-efficient graph layouts (for VLSI). In: Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci., pp. 270–281 (1980)
Schnyder, W.: Embedding planar graphs on the grid. In: Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pp. 138–148 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garg, A., Rusu, A. (2004). Area-Efficient Drawings of Outerplanar Graphs. In: Liotta, G. (eds) Graph Drawing. GD 2003. Lecture Notes in Computer Science, vol 2912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24595-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-24595-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20831-0
Online ISBN: 978-3-540-24595-7
eBook Packages: Springer Book Archive