Drawing free trees

Eades, Peter

Affiliations

¹Department of Computer Science, University of Newcastle, Newcastle, NSW, Australia, 2308

Abstract

Trees are models of various structures in computing and it is not surprising that considerable efforts have been made toward effective drawing algorithrns for them. This paper discasses drawing algorithms for "free trees", that is, trees with no special root. The aim of these algorithms is to provide a drawing which satisfies several aesthetic criteria, such as avoiding edge crossings, minimizing variance in edge length, and keeping vertices a reasonable distance apart. In this paper we measure the cffectiveness of the algorithrns presented by proving or disproving that they achieve such eriteri a,

Cited Works (2)

Year	Entry
1979	Wetherell C, Shannon A. Tidy drawings of trees. IEEE Trans Softw Eng. September 1979;5(5):514-520.
1981	Reingold EM, Tilford JS. Tidier drawings of trees. IEEE Trans Softw Eng. March 1981;7(2):223-228.

Cited By (2)

Year	Entry
2006	Grivet S, Auber D, Domenger JP, Melancon G. Bubble tree drawing algorithm. Computer Vision and Graphics Computational Imaging and Vision 32. 2006:633-641.
2006	Pavlo A, Homan C, Schull J. A parent-centered radial layout algorithm for interactive graph visualization and animation. June 1, 2006. arXiv:cs/0606007