Algorithms for drawing binary trees in the plane

Information Processing Letters

Volumn 66, Issue 3, 1998, Pages 133-139

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

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

^b Chung Ang University   (South Korea)

^c Kyungpook National University   (South Korea)

Author keywords

Computational geometry; Graph drawing; Tree drawing

Indexed keywords

EID: 0042764652     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00049-0     Document Type: Article

References (5)

1. T. Chan, M.T. Goodrich, S.R. Kosaraju, R. Tamassia, Optimizing area and aspect ratio in straight-line orthogonal tree drawings, in: Proc. Symp. on Graph Drawing 1996, to appear, 1997.
2. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Comput. Geom. 4 (1994) 235-282.
3. A. Garg, M.T. Goodrich, R. Tamassia, Area-efficient upward tree drawings, in: Proc. 9th ACM Sympo. Comput. Geom., 1993, pp. 359-368.
4. C.S. Shin, S.K. Kim, K.Y. Chwa, Area-efficient algorithms for upward straight-line tree drawings, in: Proc. 2nd Int. Computing and Combinatorics Conf., COCOON-96, 1996, pp. 106-116.
5. L.G. Valiant, Universality considerations of VLSI circuits, IEEE Trans. Comput. C-30 (12) (1981) 135-140.