This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Tidier Drawings of Trees
March 1981 (vol. 7 no. 2)
pp. 223-228
E.M. Reingold, Department of Computer Science, University of Illinois
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
Usage of this product signifies your acceptance of the Terms of Use.