A note on optimal area algorithms for upward drawings of binary trees
Computational Geometry: Theory and Applications
A note on minimum-area upward drawing of complete and Fibonacci trees
Information Processing Letters
Linear area upward drawings of AVL trees
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Area-efficient algorithms for straight-line tree drawings
Computational Geometry: Theory and Applications
Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings
GD '96 Proceedings of the Symposium on Graph Drawing
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
GridRod: a dynamic runtime scheduler for grid workflows
Proceedings of the 21st annual international conference on Supercomputing
Planar Straight-Line Embedding of Double-Tree Scan Architecture on a Rectangular Grid
Fundamenta Informaticae
Area-efficient order-preserving planar straight-line drawings of ordered trees
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Three-dimensional drawings of bounded degree trees
GD'06 Proceedings of the 14th international conference on Graph drawing
Straight-line drawings of general trees with linear area and arbitrary aspect ratio
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Small area drawings of outerplanar graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Drawing trees in a streaming model
GD'09 Proceedings of the 17th international conference on Graph Drawing
Planar Straight-Line Embedding of Double-Tree Scan Architecture on a Rectangular Grid
Fundamenta Informaticae
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
Trees are usually drawn planar, i.e. without any crossings. In this paper, we investigate the area requirement of (non-upward) planar straight-line grid drawings of binary trees. Let T be a binary tree with n nodes. We show that T admits a planar straight-line grid drawing with area O(n) and with any pre-specified aspect ratio in the range [1, n驴], where 驴 is a constant such that 0 驴 驴 O(n log n) time.