A note on optimal area algorithms for upward drawings of binary trees
Computational Geometry: Theory and Applications
Optimizing area and aspect ratio in straight-line orthogonal tree drawings
Computational Geometry: Theory and Applications
Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Planar Straight-Line Embedding of Double-Tree Scan Architecture on a Rectangular Grid
Fundamenta Informaticae
Straight-line orthogonal drawings of binary and ternary trees
GD'07 Proceedings of the 15th international conference on Graph drawing
Upward drawings of trees on the minimum number of layers
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Drawing trees in a streaming model
GD'09 Proceedings of the 17th international conference on Graph Drawing
Drawing trees in a streaming model
Information Processing Letters
Straight-line drawings of outerplanar graphs in O(dnlogn) area
Computational Geometry: Theory and Applications
Planar Straight-Line Embedding of Double-Tree Scan Architecture on a Rectangular Grid
Fundamenta Informaticae
| Hi-index | 0.00 |
Trees are usually drawn planar, i.e. without any crossings. In this paper we investigate the area requirement of planar straight-line drawings of trees. A degree-d tree is one in which each node has at most d edges incident on it. Let T be a degree-d tree with n nodes, such that d = O(nδ), where δ T admits a planar straight-line grid drawing with area O(n) and with any prespecified aspect ratio in the range [1, nα], where α is a constant such that 0 ≤ α O(n log n) time.