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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2528 LNCS, Issue , 2002, Pages 320-332

  Garg, Ashim ^a   Rusu, Adrian ^a  

^a State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASPECT RATIO; DRAWING (GRAPHICS); BINS;

ARBITRARY ASPECT RATIO; AREA REQUIREMENT; GRID DRAWING; LINEAR AREAS; STRAIGHT-LINE DRAWINGS;

BINARY TREES;

EID: 84867438186     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36151-0_30     Document Type: Conference Paper

References (9)

1. T. Chan, M. Goodrich, S. Rao Kosaraju, and R. Tamassia. Optimizing area and aspect ratio in straight-line orthogonal tree drawings. Comput. Geom. Theory Appl. to appear. Prel. version in Proc. Graph Drawing'96, LNCS, vol. 1190, pp. 63-75.
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.
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-2002, 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.