Area-efficient algorithms for upward straight-line tree drawings

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

Volumn 1090, Issue , 1996, Pages 106-116

  Shin, Chan Su ^a   Kim, Sung Kwon ^b   Chwa, Kyung Yong ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b Chung Ang University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AREA-EFFICIENT ALGORITHMS; BALANCED TREES; BOUNDED DEGREE TREES; DRAWING ALGORITHMS; ORTHOGONAL DRAWINGS; ORTHOGONAL SEGMENTS; RED BLACK TREE; STRAIGHT-LINE DRAWINGS;

TREES (MATHEMATICS);

EID: 84948991950     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61332-3_143     Document Type: Conference Paper

References (14)

1. P. Crescenzi, G. Di Battista, and A. Piperno. A note on optimal area algorithms for upward drawings of binary trees. Computational Geometry: Theory and Applications, pages 187-200, 1992.
2. P. Crescenzi and A. Piperno. Optimal-area upward drawings of AVL trees. In R. Tamassia and I. G. Tollis, editors, Proc. Graph Drawing: DIM ACS international workshop, GD'94, volume 894 of LNCS, pages 307-317. Springer Verlag, 1994.
3. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications, 4: 235-282, 1994.
4. A. Garg, M. T. Goodrich, and R. Tamassia. Area-efficient upward tree drawings. In Proc. 9th Annu. ACM Sympo. Comput. Geom., pages 359-368, 1993.
5. H. Gazit, G. L. Miller, and S-H Teng. Optimal tree contraction in an EREW model. In S. K. Tewksbury, B. W. Dickinson, and S. C. Schwartz, editors, Concurrent Computations: Algorithms, Architecture and Technology, pages 139-156. Plenum Press, 1988.
6. R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley Publishing Company, 1989.
7. S. K. Kim. Simple algorithms for orthogonal upward drawings of binary and ternary trees. In Proc. 7th Canadian Conference on Computational Geometry, pages 115-120, 1995.
8. C. E. Leiserson. Area efficient VLSI computation. MIT Press, 1983.
9. Kurt Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching. Springer-Verlag, 1984.
10. M. H. Overmars. The Design of Dynamic Data Structures. LNCS 894, Springer Verlag, 1976.
11. R. F. Cohen, P. Eades, T. Lin, and F. Ruskey. Three-dimensional graph drawing. In R. Tamassia and I. G. Tollis, editors, Proc. Graph Drawing: DIM ACS international workshop, GD'94, volume 894 of LNCS, pages 1-11. Springer Verlag, 1994.
12. Y. Shiloach. Arrangements of Planar Graphs on the Planar Lattice. PhD thesis, Weizmann Institute of Science, 1976.
13. J. D. Ullman. Computational Aspects of VLSI. Computer Science Press, 1984.
14. L. G. Valiant. Universality considerations of VLSI circuits. IEEE Trans on Computers, C-30: 12: 135-140, 1981.