Abstract
In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex is represented by a point and 2) grid visibility representation (that is, a line segment is allowed to represent a vertex). For the first drawing standard, we show an exponential area lower bound needed for drawing hierarchically planar graphs. The lower bound holds even for hierarchical graphs without transitive arcs, in contrast to the results for upward planar drawing. Applications of some existing algorithms from upward drawing can guarantee the quadratic drawing area for grid visibility representation but do not necessarily guarantee the minimum drawing area. Motivated by this, we will present another grid visibility drawing algorithm which is efficient and guarantees the minimum drawing area.
Chapter PDF
Similar content being viewed by others
Keywords
References
J. A. Bondy and U. S. R. Murty, Graph Theory with Application, The Macmilan Press LTD, 1977.
G. Di Battista, P. D. Eades, R. Tamassia, and I. Tollis, Algorithms for Automatic Graph Drawing: An Annotated Bibliography, Computational Geometry: Theory and Application, 4, 235–282, 1994.
G. Di Battista and E. Nardelli, Hierarchies and Planarity Theory, IEEE Tran. Sys. Man Cybern. 18(6), 1035–1046, 1988.
G. Di Battista and R. Tamassia, Algorithms for Plane Representations of Acyclic Diagraphs, Theoretical Computer Science, 61, 175–198, 1988.
G. Di Battista and R. Tamassia, On-Line Planarity Testing, SIAM Journal on Computing, 25(5), 1996.
G. Di Battista, R. Tamassia, and I. G. Tollis, Area Requirement and Symmetry Display of Planar Upward Drawings, Discrete & Computational Geometry, 7(381–401), 1992.
P. Eades, Q. Feng and X. Lin, Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs, Graph Drawing'96, LNCS 1190, Springer-Verlag, 113–128, 1996.
P. Eades, X. Lin and R. Tamassia, An Algorithm for Drawing a Hierarchical Graph, International Journal of Computational Geometry and Applications, 6(2), 145–155, 1996.
A. Garg and R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, Graph Drawing'94, LNCS, Springer-Verlag, 286–297, 1995.
L. S. Heath and S. V. Pemmaraju, Recognizing Leveled-Planar Dags in Linear Time, Draph Drawing'95, LNCS 1027, Springer-Verlag, 1995.
X. Lin, Analysis of Algorithms for Drawing Graphs, PHD thesis, University of Queensland, 1992.
X. Lin and P. Eades, Area Requirement for Drawing Hierarchically Planar Graphs, Tec. Rep., The University of Western Australia, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, X., Eades, P. (1997). Area requirements for drawing hierarchically planar graphs. In: DiBattista, G. (eds) Graph Drawing. GD 1997. Lecture Notes in Computer Science, vol 1353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63938-1_64
Download citation
DOI: https://doi.org/10.1007/3-540-63938-1_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63938-1
Online ISBN: 978-3-540-69674-2
eBook Packages: Springer Book Archive