Towards area requirements for drawing hierarchically planar graphs

DOI10.1016/S0304-3975(02)00031-2zbMath1026.68101MaRDI QIDQ1870562

Peter Eades, Xuemin Lin

Publication date: 14 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

graph drawingvisibility representationstraight-line drawingdrawing areahierarchically planar graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Convexity-increasing morphs of planar graphs ⋮ Hanani-Tutte and Monotone Drawings

Cites Work

• Algorithms for plane representations of acyclic digraphs
• Area requirement and symmetry display of planar upward drawings
• Algorithms for drawing graphs: An annotated bibliography
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Hierarchies and planarity theory
• On-Line Planarity Testing
• AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards area requirements for drawing hierarchically planar graphs