Information visualisation using composable layouts and visual sets
APVis '01 Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9
Graph Visualization and Navigation in Information Visualization: A Survey
IEEE Transactions on Visualization and Computer Graphics
RINGS: A Technique for Visualizing Large Hierarchies
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Space-optimized tree: a connection+enclosure approach for the visualization of large hierarchies
Information Visualization
EncCon: an approach to constructing interactive visualization of large hierarchical data
Information Visualization
Improvements of space-optimized tree for visualizing and manipulating very large hierarchies
VIP '02 Selected papers from the 2002 Pan-Sydney workshop on Visualisation - Volume 22
Angle and distance constraints on tree drawings
GD'06 Proceedings of the 14th international conference on Graph drawing
Smoother transitions between breadth-first-spanning-tree-based drawings
GD'06 Proceedings of the 14th international conference on Graph drawing
Interactive illustrative visualization of hierarchical volume data
Proceedings of Graphics Interface 2010
A comparison of a conventional taxonomy with a 3D visualization for use by children
Proceedings of the 73rd ASIS&T Annual Meeting on Navigating Streams in an Information Ecosystem - Volume 47
MoireGraphs: radial focus+context visualization and interaction for graphs with visual nodes
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
Drawing trees with perfect angular resolution and polynomial area
GD'10 Proceedings of the 18th international conference on Graph drawing
On balloon drawings of rooted trees
GD'05 Proceedings of the 13th international conference on Graph Drawing
| Hi-index | 0.00 |
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.