Sciweavers

Share
ALGORITHMICA
2002

A Near-Linear Area Bound for Drawing Binary Trees

8 years 6 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 O(n1+) area is always sufficient for an arbitrary constant > 0. Key Words. Graph drawing, Trees.
Timothy M. Chan
Added 16 Dec 2010
Updated 16 Dec 2010
Type Journal
Year 2002
Where ALGORITHMICA
Authors Timothy M. Chan
Comments (0)
books