论文信息 - A Near-Linear Area Bound for Drawing Binary Trees

A Near-Linear Area Bound for Drawing Binary Trees

AbstractWe 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 .

Timothy M. Chan

[1] Leslie G. Valiant,et al. Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.

[2] Charles E. Leiserson,et al. Area-Efficient Graph Layouts (for VLSI) , 1980, FOCS.

[3] Michael T. Goodrich,et al. Planar upward tree drawings with optimal area , 1996, Int. J. Comput. Geom. Appl..

[4] Sung Kwon Kim. Logarithmic Width, Linear Area Upward Drawing of AVL Trees , 1997, Inf. Process. Lett..

[5] Kyung-Yong Chwa,et al. Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract) , 1996, COCOON.

[6] Giuseppe Di Battista,et al. A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees , 1992, Comput. Geom..

[7] Luca Trevisan. A Note on Minimum-Area Upward Drawing of Complete and Fibonacci Trees , 1996, Inf. Process. Lett..

[8] Timothy M. Chan,et al. Optimizing area and aspect ration in straight-line orthogonal tree drawings , 1996, Comput. Geom..

[9] Ioannis G. Tollis,et al. Graph Drawing , 1994, Lecture Notes in Computer Science.

[10] Pierluigi Crescenzi,et al. Optimal-Area Upward Drawings of AVL Trees , 1994, Graph Drawing.