9 search results - page 1 / 2 » A Near-Linear Area Bound for Drawing Binary Trees |
ALGORITHMICA
2002
13 years 4 months ago
2002
We present several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n-node binary tree. In particular, it is shown that...
CCCG
1998
13 years 5 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
IPL
2002
13 years 4 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
GD
1997
Springer
13 years 8 months ago
1997
Springer
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...