Elsevier

Computational Geometry

Volume 23, Issue 2, September 2002, Pages 153-162
Computational Geometry

Optimizing area and aspect ratio in straight-line orthogonal tree drawings

https://doi.org/10.1016/S0925-7721(01)00066-9Get rights and content
Under an Elsevier user license
open archive

Abstract

We investigate the problem of drawing an arbitrary n-node binary tree orthogonally and upwardly in an integer grid using straight-line edges. We show that one can simultaneously achieve good area bounds while also allowing the aspect ratio to be chosen as a fixed constant or a parameter under the user's control. In addition, we show that one can also achieve an additional desirable aesthetic criterion, which we call “subtree separation”. Our drawings require O(nlogn) area, which we show is optimal to within constant factors in the worst case (i.e. there are trees that need Ω(nlogn) area for any upward orthogonal straight-line drawing with good aspect ratio). An improvement for non-upward drawings is briefly mentioned.

Keywords

Graph drawing
Binary trees

Cited by (0)

This work is a consequence of the participation of Drs. Goodrich and Tamassia in the 1996 International Workshop on 3D Graph Drawing at Bellairs Research Inst. of McGill University.

1

This research was performed while the author was visiting the Center for Geometric Computing at Johns Hopkins University, and it was supported in part by ARO under grant DAAH04-96-1-0013.

2

This research supported by NSF under Grant CCR-9300079 and by ARO under grant DAAH04-96-1-0013.

3

This research supported by NSF under Grant CCR-9508545 and by ARO under grant DAAH04-96-1-0013.

4

This research supported by NSF under Grant CCR-9423847 and by ARO under grant DAAH04-96-1-0013.