论文信息 - Linear area upward drawings of AVL trees

Linear area upward drawings of AVL trees

Abstract We prove that any AVL tree admits a linear-area straight-line strictly-upward planar grid drawing, that is, a drawing in which (a) each edge is mapped into a single straight-line segment, (b) each node is placed below its parent, (c) no two edges intersect, and (d) each node is mapped into a point with integer coordinates.

[1] Donald E. Knuth,et al. The art of computer programming: sorting and searching (volume 3) , 1973 .

[2] M. AdelsonVelskii,et al. AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .

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

[4] Tao Lin,et al. Minimum Size h-v Drawings , 1992, Advanced Visual Interfaces.

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

[6] Michael T. Goodrich,et al. Area-efficient upward tree drawings , 1993, SCG '93.

[7] Edward M. Reingold,et al. Tidier Drawings of Trees , 1981, IEEE Transactions on Software Engineering.

[8] J. Wrench. Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth , 1970 .

[9] Ioannis G. Tollis,et al. Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..