Circular drawings of rooted trees
We describe an algorithm producing circular layouts for trees, that is drawings, where subtrees of a node lie within circles, and these circles are themselves placed on the circumference of a circle. The complexity and methodology of our algorithm compares to Reingold and Tilford's algorithm for trees. Moreover, the algorithm naturally admits distortion transformations of the layout. This, added to its low complexity, makes it very well suited to be used in an interactive environment.
|Design Tools and Techniques (acm D.2.2), DATA STRUCTURES (acm E.1), Combinatorics (acm G.2.1), Graph Theory (acm G.2.2)|
|Information Systems [INS]|
|Organisation||Standardization and Knowledge Transfer|
Melançon, G, & Herman, I. (1998). Circular drawings of rooted trees. Information Systems [INS]. CWI.