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.

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 66; no. 3; pp. 133 - 139
Main Authors:	Shin, Chan-Su, Kim, Sung Kwon, Kim, Sung-Ho, Chwa, Kyung-Yong
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 15-05-1998 Elsevier Science Elsevier Sequoia S.A
Subjects:	Algorithms Applied sciences Computational geometry Computer science; control theory; systems Exact sciences and technology Geometry Graph drawing Information processing Information retrieval. Graph Studies Theoretical computing Tree drawing Graph drawing Computational geometry Tree drawing Binary tree Graph theory Algorithms
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
ISSN:	0020-0190 1872-6119
DOI:	10.1016/S0020-0190(98)00049-0