论文信息 - Algorithms for Drawing Binary Trees in the Plane

Algorithms for Drawing Binary Trees in the Plane

In this paper, we present several algorithms for drawing binary trees in the plane under various measures such as area, aspect ratio, the sum of edge lengths, and the number of bends per edge.

Kyung-Yong Chwa | Chan-Su Shin | Sung-Ho Kim | Sung Kwon Kim

[1] Michael T. Goodrich,et al. Area-efficient upward tree drawings , 1993, SCG '93.

[2] Kyung-Yong Chwa,et al. Area-Efficient Algorithms for Upward Straight-Line Tree Drawings (Extended Abstract) , 1996, COCOON.

[3] Timothy M. Chan,et al. Optimizing area and aspect ration in straight-line orthogonal tree drawings , 1996, Comput. Geom..

[4] Ioannis G. Tollis,et al. Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..