Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings

Chan, Timothy M. and Goodrich, Michael T. and Kosaraju, Rao and Tamassia, Roberto (1997) Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996 , pp. 63-75(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_38).

Full text not available from this repository.


We investigate the problem of drawing an arbitrary n-node binary tree orthogonally in an integer grid using straight-line edges. We show that one can simultaneously achieve good area bounds while also allowing the aspekt ratio to be chosen as being O(1) or sometimes even an arbitrary parameter. In addition, we show that one can also achieve an additional desirable aesthetic criterion, which we call "subtree separation". We investigate both upward and non-upward drawings, achieving area bounds of O(nlogn) and O(nloglogn), respectively, and we show that, at least in the case of upward drawings, our area bound is optimal to within constant factors.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-62495-3_38
Classifications: P Styles > P.720 Straight-line
G Algorithms and Complexity > G.070 Area / Edge Length
D Aesthetics > D.999 Others
M Methods > M.900 Tree
P Styles > P.600 Poly-line > P.600.700 Orthogonal
URI: http://gdea.informatik.uni-koeln.de/id/eprint/66

Actions (login required)

View Item View Item