Linear area upward drawings of AVL trees

Computational Geometry: Theory and Applications

Volumn 9, Issue 1-2, 1998, Pages 25-42

  Crescenzi, P ^a   Penna, P ^a   Piperno, A ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Area requirement; Graph drawing; Upward drawing

Indexed keywords

EID: 0039346907     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(97)00013-8     Document Type: Article

References (13)

1. G.M. Adelson-Velskii, E.M. Landis, An algorithm for the organization of information, Soviet Math. Dokl. 3 (1962) 1259-1262.
2. P. Crescenzi, G. Di Battista, A. Piperno, A note on optimal area algorithms for upward drawings of binary trees, Computational Geometry: Theory and Applications 2 (4) (1992) 187-200.
3. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Computational Geometry: Theory and Applications 4 (5) (1994) 235-282.
4. P. Eades, T. Lin, X. Lin, Minimum size h-v drawings, in: Proceedings International Workshop AVI '92, 1992, pp. 386-394.
5. A. Garg, M.T. Goodrich, R. Tamassia, Area-efficient upward tree drawing, in: Proceedings ACM Symposium on Computational Geometry, 1993, pp. 359-368.
6. R.L. Graham, D.E. Knuth, O. Patashnik, Concrete Mathematics, Addison-Wesley, Reading, MA, 1989.
7. Y. Horibe, An entropy view of Fibonacci trees, Fibonacci Quarterly 20 (1982) 168-178.
8. Y. Horibe, Notes on Fibonacci trees and their optimality, Fibonacci Quarterly 21 (1983) 118-128.
9. D.E. Knuth, The Art of Computer Programming: Sorting and Searching, Addison-Wesley, Reading, MA, 1975.
10. E. Reingold, J. Tilford, Tidier drawing of trees, IEEE Trans. Software Engrg. 7 (1981) 223-228.
11. Y. Shiloach, Linear and planar arrangements of graphs, Ph.D. Thesis, Department of Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel, 1976.
12. K.J. Supowit, E. Reingold, The complexity of drawing trees nicely, Acta Informatica 18 (1983) 377-392.
13. L. Valiant, Universality considerations in VLSI circuits, IEEE Trans. Comput. 30 (2) (1981) 135-140.