Area requirements for drawing hierarchically planar graphs

  • Xuemin Lin
  • Peter Eades
Crossings and Planarity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1353)


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.


Graph Drawing Hierarchically Planar Graph Straight Line Drawing Visibility Representation Drawing Area 


  1. 1.
    J. A. Bondy and U. S. R. Murty, Graph Theory with Application, The Macmilan Press LTD, 1977.Google Scholar
  2. 2.
    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.MathSciNetGoogle Scholar
  3. 3.
    G. Di Battista and E. Nardelli, Hierarchies and Planarity Theory, IEEE Tran. Sys. Man Cybern. 18(6), 1035–1046, 1988.CrossRefGoogle Scholar
  4. 4.
    G. Di Battista and R. Tamassia, Algorithms for Plane Representations of Acyclic Diagraphs, Theoretical Computer Science, 61, 175–198, 1988.CrossRefGoogle Scholar
  5. 5.
    G. Di Battista and R. Tamassia, On-Line Planarity Testing, SIAM Journal on Computing, 25(5), 1996.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    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.CrossRefGoogle Scholar
  9. 9.
    A. Garg and R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, Graph Drawing'94, LNCS, Springer-Verlag, 286–297, 1995.Google Scholar
  10. 10.
    L. S. Heath and S. V. Pemmaraju, Recognizing Leveled-Planar Dags in Linear Time, Draph Drawing'95, LNCS 1027, Springer-Verlag, 1995.Google Scholar
  11. 11.
    X. Lin, Analysis of Algorithms for Drawing Graphs, PHD thesis, University of Queensland, 1992.Google Scholar
  12. 12.
    X. Lin and P. Eades, Area Requirement for Drawing Hierarchically Planar Graphs, Tec. Rep., The University of Western Australia, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Xuemin Lin
    • 1
  • Peter Eades
    • 2
  1. 1.Department of Computer ScienceThe University of Western AustraliaNedlandsAustralia
  2. 2.Department of Computer ScienceThe University of NewcastleCallaghanAustralia

Personalised recommendations