Straight-line drawings of binary trees with linear area and arbitrary aspect ratio

Journal of Graph Algorithms and Applications

Volumn 8, Issue 2, 2004, Pages 135-160

  Garg, Ashim ^a   Rusu, Adrian ^b  

^a State University of New York   (United States)

^b Rowan University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 24344446829     PISSN: 15261719     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00086     Document Type: Conference Paper

References (9)

1. T.M. Chan, M. Goodrich, S. Rao Kosaraju, and R. Tamassia. Optimizing area and aspect ratio in straight-line orthogonal tree drawings. Computational Geometry: Theory and Applications, 23:153-162, 2002.
2. P. Crescenzi, G. Di Battista, and A. Piperno. A note on optimal area algorithms for upward drawings of binary trees. Comput. Geom. Theory Appl., 2:187-200, 1992.
3. P. Crescenzi, P. Penna, and A. Piperno. Linear-area upward drawings of AVL trees. Comput. Geom. Theory Appl., 9:25-42, 1998. (special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia).
4. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.
5. A. Garg, M. T. Goodrich, and R. Tamassia. Planar upward tree drawings with optimal area. Internat. J. Comput. Geom. Appl., 6:333-356, 1996.
6. C. E. Leiserson. Area-efficient graph layouts (for VLSI). In Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci., pages 270-281, 1980.
7. C.-S. Shin, S.K. Kim, S.-H. Kim, and K.-Y. Chwa. Area-efficient algorithms for straight-line tree drawings. Comput. Geom. Theory Appl., 15:175-202, 2000.
8. L. Trevisan. A note on minimum-area upward drawing of complete and Fibonacci trees. Inform. Process. Lett., 57(5):231-236, 1996.
9. L. Valiant. Universality considerations in VLSI circuits. IEEE Trans. Comput., C-30(2):135-140, 1981.