Sciweavers

ALGORITHMICA
2002
109views more  ALGORITHMICA 2002»
13 years 11 months ago
A Near-Linear Area Bound for Drawing Binary Trees
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...
Timothy M. Chan