Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

66

Voted

ALGORITHMICA
2002

favoriteEmaildiscussreport

109views more ALGORITHMICA 2002»

A Near-Linear Area Bound for Drawing Binary Trees

14 years 10 months ago

A Near-Linear Area Bound for Drawing Binary Trees

Download grid.tsinghua.edu.cn

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

Real-time Traffic

ALGORITHMICA 2002 | N-node Binary Tree | Simple Methods | Straight-line Drawings |

claim paper

Related Content

» Proximity drawings of binary trees in polynomial area

» On the approximability of two tree drawing conventions

» MinimumArea hv Drawings of Complete Binary Trees

» Proximity drawings in polynomial area and volume

» Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs

» Untangling Tanglegrams Comparing Trees by Their Drawings

» PRISAD A Partitioned Rendering Infrastructure for Scalable Accordion Drawing

» More Practical BoundedSkew Clock Routing

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2002
Where	ALGORITHMICA
Authors	Timothy M. Chan

Comments (0)