Abstract
We investigate the problem of drawing an arbitrary «-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(;i log«) area, which we show is optimal to within constant factors in the worst case (i.e. there are trees that need £2 (H log«) area for any upward orthogonal straight-line drawing with good aspect ratio). An improvement for non-upward drawings is briefly mentioned.
Original language | English (US) |
---|---|
Pages (from-to) | 153-162 |
Number of pages | 10 |
Journal | Computational Geometry: Theory and Applications |
Volume | 23 |
Issue number | 2 |
DOIs | |
State | Published - 2002 |
Externally published | Yes |
Keywords
- Binary trees
- Graph drawing
ASJC Scopus subject areas
- Computer Science Applications
- Geometry and Topology
- Control and Optimization
- Computational Theory and Mathematics
- Computational Mathematics