A Near-Linear Area Bound for Drawing Binary Trees (2001)
Cached
Download Links
- [www.cs.uwaterloo.ca]
- [www.cs.uwaterloo.ca]
- DBLP
Other Repositories/Bibliography
by
Timothy M. Chan
| Venue: | In Proc. 10th Annu. ACM-SIAM Sympos. on Discrete Algorithms |
| Citations: | 7 - 0 self |
BibTeX
@INPROCEEDINGS{Chan01anear-linear,
author = {Timothy M. Chan},
title = {A Near-Linear Area Bound for Drawing Binary Trees},
booktitle = {In Proc. 10th Annu. ACM-SIAM Sympos. on Discrete Algorithms},
year = {2001},
pages = {161--168}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present several simple methods to construct planar, strictly upward, strongly orderpreserving, straight-line drawings of any n-node binary tree. In particular, it is shown that O(n 1+" ) area is always sucient for an arbitrary constant " > 0. Key Words. Graph drawing, Trees. 1
