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

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

Volumn 1190, Issue , 1997, Pages 63-75

  Chan, Timothy ^a   Goodrich, Michael T ^a   Kosaraju, S Rao ^a   Tamassia, Roberto ^b  

^a Johns Hopkins University   (United States)

^b Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; DRAWING (GRAPHICS);

AESTHETIC CRITERIA; CONSTANT FACTORS; SUB TREES; UPWARD DRAWING;

ASPECT RATIO;

EID: 84957683304     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62495-3_38     Document Type: Conference Paper

References (11)

1. R. P. Brent and H. T. Kung. On the area of binary tree layouts. Inform. Process. Left., 11:521-534, 1980.
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 and A. Piperno. Optimal-area upward drawings of AVL trees. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD ’94), volume 894 of Lecture Notes in Computer Science, pages 307-317. Springer-Verlag, 1995.
4. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235-282, 1994.
5. A. Garg, M. T. Goodrich, and R. Tamassia. Area-efficient upward tree drawings. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 359-368, 1993.
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. E. Leiserson. Area-efficient graph layouts (for VLSI). ACM Doctoral Dissertation Award Series. MIT Press, Cambridge, MA, 1983.
8. E. Reingold and J. Tilford. Tidier drawing of trees. IEEE Trans. Softw. Eng., SE-7(2):223-228, 1981.
9. Y. Shiloach. Arrangements of Planar Graphs on the Planar Lattice. PhD thesis, Weizmann Institute of Science, 1976.
10. L. Trevisan. A note on minimum-area upward drawing of complete and Fibonacci trees. Information Processing Letters, 57(5):231-236, 1996.
11. L. Valiant. Universality considerations in VLSI circuits. IEEE Trans. Comput., C-30(2):135-140, 1981.