Circular drawings of rooted trees
Abstract
We describe an algorithm producing circularlayouts 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 11. 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. 1991 Computing Reviews Classication System: D.2.2, E.1, G.2.1, G.2.2 Keywords and Phrases: Rooted trees, graph drawing, information visualization Note: At CWI, the work was carried under the project INS3.2 Information Visualization". 1. INTRODUCTION Rooted trees are at the center of many problems and applications in computer science. Information systems, multimedia documents databases, or virtual reality scene descriptions are only a few examples in which they are used. Their widespread use is mo...
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime