The complexity of minimizing wire lengths in VLSI layouts
Information Processing Letters
Small sets supporting fary embeddings of planar graphs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the angular resolution of planar graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
O(nlog log n)-work parallel algorithms for straight-line grid embeddings of planar graphs
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A framework for dynamic graph drawing
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Area requirement and symmetry display of planar upward drawings
Discrete & Computational Geometry
A note on optimal area algorithms for upward drawings of binary trees
Computational Geometry: Theory and Applications
Angles of planar triangular graphs
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Embedding planar graphs on the grid
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Graph Theory With Applications
Graph Theory With Applications
Constraints
VLSI layout of trees into grids of minimum width
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Volume upper bounds for 3D graph drawing
CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
Proximity drawings in polynomial area and volume
Computational Geometry: Theory and Applications
Upward drawings of trees on the minimum number of layers
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
GD'05 Proceedings of the 13th international conference on Graph Drawing
Minimum-width grid drawings of plane graphs
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Rooted trees are usually drawn planar and upward, i.e., without crossings and with parents placed above their children. In this paper we investigate the area requirement of planar upward drawings of trees, and present optimal algorithms for constructing such drawings.