StraightLine Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio (Extended Abstract)Garg, Ashim and Rusu, Adrian (2002) StraightLine Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio (Extended Abstract). In: Graph Drawing 10th International Symposium, GD 2002, August 2628, 2002 , pp. 320331(Official URL: http://dx.doi.org/10.1007/3540361510_30). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/3540361510_30
AbstractTrees are usually drawn planar, i.e. without any crossings. In this paper, we investigate the area requirement of (nonupward) planar straightline grid drawings of binary trees. Let T be a binary tree with n nodes. We show that T admits a planar straightline grid drawing with area O(n) and with any prespecified aspect ratio in the range [1,n^\alpha], where \alpha is a constant such that 0 \leq \alpha < 1. We also show that such a drawing can be constructed in O(n log n) time.
Actions (login required)
