Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
Ashim Garg, Adrian Rusu · Journal of Graph Algorithms and Applications · 2004
Trees are usually drawn planar, i.e. without any edge-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 [n−ϵ,nϵ], where ϵ is any constant, such that 0 < ϵ < 1. We also show that such a drawing can be constructed in O(nlogn) time. In particular, our result shows that optimal area (equal to O(n)) and optimal aspect ratio (equal to 1) are simultaneously achievable for such drawings.