Optimizing area and aspect ratio in straight-line orthogonal tree drawings

Computational Geometry: Theory and Applications

Volumn 23, Issue 2, 2002, Pages 153-162

  Chan, Timothy M ^a   Goodrich, Michael T ^b   Rao Kosaraju, S ^c   Tamassia, Roberta ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b JOHNS HOPKINS UNIVERSITY   (United States)

^c Brown Univerity   (United States)

Author keywords

Binary trees; Graph drawing

Indexed keywords

EID: 31244433077     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00066-9     Document Type: Article

References (14)

1. R.P. Brent, H.T. Kung, On the area of binary tree layouts, Inform. Process. Lett. 11 (1980) 521-534.
2. T.M. Chan, M.T. Goodrich, S.R. Kosaraju, R. Tamassia, Optimizing area and aspect ratio in straight-line orthogonal tree drawings, in: S. North (Ed.), Graph Drawing (Proc. GD '96), Lecture Notes Comput. Sci., Vol. 1190, Springer, Berlin, 1997, pp. 63-75.
3. P. Crescenzi, G. Di Battista, A. Pipemo, A note on optimal area algorithms for upward drawings of binary trees, Computational Geometry 2 (1992) 187-200.
4. P. Crescenzi, P. Penna, A. Piperno, Linear-area upward drawings of AVL trees, Computational Geometry 9 (1998) 25-42 (Special Issue on Graph Drawing, edited by G. Di Battista and R. Tamassia).
5. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Computational Geometry 4 (1994) 235-282.
6. A. Garg, M.T. Goodrich, R. Tamassia, Planar upward tree drawings with optimal area, Internat. J. Comput. Geom. Appl. 6 (1996) 333-356.
7. S.K. Kirn, Logarithmic width, linear area upward drawing of AVL trees, Inform. Process. Lett. 63 (1997) 303-307.
8. C.E. Leiserson, Area-efficient graph layouts (for VLSI), ACM Doctoral Dissertation Award Series, MIT Press, Cambridge, MA, 1983.
9. E. Reingold, J. Tilford, Tidier drawing of trees, IEEE Trans. Softw. Engrg. SE-7 (2) (1981) 223-228.
10. Y. Shiloach, Arrangements of Planar Graphs on the Planar Lattice, PhD Thesis, Weizmann Institute of Science, 1976.
11. C.-S. Shin, S.K. Kim, K.-Y. Chwa, Area-efficient algorithms for straight-line tree drawings, Computational Geometry 15 (2000) 175-202.
12. C.-S. Shin, S.K. Kirn, S.-H. Kirn, K.-Y. Chwa, Algorithms for drawing binary trees in the plane, Inform. Process. Lett. 66 (1998) 133-139.
13. L. Trevisan, A note on minimum-area drawing of complete and Fibonacci trees, Inform. Process. Lett. 57 (1996) 231-236.
14. L. Valiant, Universality considerations in VLSI circuits, IEEE Trans. Comput. C-30 (2) (1981) 135-140.