Skip to Main Content
Trees are usually drawn using planar straight-line drawings.  presented an algorithm for constructing a planar straight-line grid drawing of a degree-d (general) tree with area 0(eta) and any pre-specified aspect ratio in the range [eta-alpha,eta alpha], where 0 < alpha < 1 is any constant, in O(etalogeta) time. Unfortunately, the algorithm of  is not suitable for practical use. The main problem is that the constant hidden in the "Oh " notation for area is quite large (for binary trees was 3900). In this paper, we have made several improvements to the algorithm, which make it suitable for practical use. We have also conducted an experiment on this newer version of the algorithm for randomly-generated general trees with up to 50,000 nodes. Our experiment shows that it constructs area-efficient drawings in practice, with area at most 19 times the number of nodes.