Area minimization for grid visibility representation of hierarchically planar graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1627, Issue , 1999, Pages 92-102

  Lin, Xuemin ^a   Eades, Peter ^b  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

Drawing area; Graph drawing; Hierarchically planar graph; Visibility representation

Indexed keywords

APPLICATION PROGRAMS; COMBINATORIAL MATHEMATICS; DRAWING (GRAPHICS); GRAPH THEORY; INFORMATION SYSTEMS; POLYNOMIAL APPROXIMATION; VISIBILITY;

AREA MINIMIZATION; GRAPH DRAWING; HIERARCHICAL GRAPHS; INFORMATION VISUALIZATION; PLANAR GRAPH; QUADRATIC ALGORITHMS; REAL APPLICATIONS; VISIBILITY REPRESENTATION;

GRAPHIC METHODS;

EID: 84867462044     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48686-0_9     Document Type: Conference Paper

References (16)

1. J. A. Bondy and U. S. R. Murty, Graph Theory with Application, The Macmilan Press LTD, 1977.
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.
3. G. Di Battista and E. Nardelli, Hierarchies and Planarity Theory, IEEE Tran. Sys. Man Cybern. 18(6), 1035-1046, 1988.
4. G. Di Battista and R. Tamassia, Algorithms for Plane Representations of Acyclic Digraphs, Theoretical Computer Science, 61, 175-198, 1988.
5. G. Di Battista and R. Tamassia, On-Line Planarity Testing, SIAM Journal on Computing, 25(5), 1996.
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.
7. P. Eades, Q. Feng, X. Lin, and H. Nagamocha, Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs, to appear in Algorithmic.
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.
9. M. R. Garey and D. S. Johnson, Computers and Intractability - a guide to the theory of NP-Completeness, Freeman, 1979.
10. A. Garg and R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, Graph Drawing'94, LNCS, Springer-Verlag, 286-297, 1995.
11. L. S. Heath and S. V. Pemmaraju, Recognizing Leveled-Planar Dags in Linear Time, Graph Drawing'95, LNCS 1027, Springer-Verlag, 1995.
12. X. Lin, Analysis of Algorithms for Drawing Graphs, PHD thesis, University of Queensland, 1992.
13. X. Lin and P. Eades, Area Requirements for Drawing Hierarchically Planar Graphs, Graph Drawing'97, LNCS, Springer-Verlag, 1997.
14. X. Lin and P. Eades, Towards Area Requirements for Drawing Hierarchically Planar Graphs, Manuscript, UNSW, 1998.
15. R. Tamassia, On Embedding a Graph in the Grid with the Minimum Number of Bends, SIAM J. Computing 16(3), 421-444, 1987.
16. R. Tamassia and I. G. Tollis, Tesselation Representations of Planar Graphs, Proc. 27th Annual Allerton Conf, 1989.