ContactPerson: agarg@cse.buffalo.edu Remote host: ramanujan.cse.buffalo.edu ### Begin Citation ### Do not delete this line ### %R 2002-04 %U /visualization/agarg/research/treedraw/techreptree2.ps %A Garg, Ashim %A Rusu, Adrian %T Straight-line Drawings of Binary Trees with Linear Area and Good Aspect Ratio %D April 24, 2002 %I Department of Computer Science and Engineering, SUNY Buffalo %K tree drawing straight-line grid planar aspect ratio area %X Trees are usually drawn planar, i.e. without any crossings.In this paper, we investigate the area requirement of (non-upward) planar straight-line drawings of binary trees. Let $T$ be a binary tree with $n$ vertices. We show that $T$ admits a planar straight-line 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 <= \alpha < 1. We also show that such a drawing can be constructed in O(nlog n) time.