The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - March (1981 vol.7)
pp: 223-228
E.M. Reingold , Department of Computer Science, University of Illinois
ABSTRACT
Various algorithms have been proposed for producing tidy drawings of trees-drawings that are aesthetically pleasing and use minimum drawing space. We show that these algorithms contain some difficulties that lead to aesthetically unpleasing, wider than necessary drawings. We then present a new algorithm with comparable time and storage requirements that produces tidier drawings. Generalizations to forests and m-ary trees are discussed, as are some problems in discretization when alphanumeric output devices are used.
INDEX TERMS
tree structures, Data structures, trees
CITATION
E.M. Reingold, J.S. Tilford, "Tidier Drawings of Trees", IEEE Transactions on Software Engineering, vol.7, no. 2, pp. 223-228, March 1981, doi:10.1109/TSE.1981.234519
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool