Tidier Drawings of Trees

  • Authors:
  • E. M. Reingold;J. S. Tilford

  • Affiliations:
  • Department of Computer Science, University of Illinois;-

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 1981

Quantified Score

Hi-index 0.01

Visualization

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.