Tree visualization with tree-maps: 2-d space-filling approach
ACM Transactions on Graphics (TOG)
Laying out and visualizing large trees using a hyperbolic space
UIST '94 Proceedings of the 7th annual ACM symposium on User interface software and technology
Visualizing the evolution of Web ecologies
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Readings in information visualization: using vision to think
Readings in information visualization: using vision to think
Cushion Treemaps: Visualization of Hierarchical Information
INFOVIS '99 Proceedings of the 1999 IEEE Symposium on Information Visualization
A Space-Optimized Tree Visualization
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Information Visualization: Perception for Design
Information Visualization: Perception for Design
Voronoi treemaps for the visualization of software metrics
SoftVis '05 Proceedings of the 2005 ACM symposium on Software visualization
TreePlus: Interactive Exploration of Networks with Enhanced Tree Layouts
IEEE Transactions on Visualization and Computer Graphics
Visualizing Business Data with Generalized Treemaps
IEEE Transactions on Visualization and Computer Graphics
Visualizing the activity of a web-based collaborative platform
IV '07 Proceedings of the 11th International Conference Information Visualization
IEEE Transactions on Visualization and Computer Graphics
Point-based tree representation: A new approach for large hierarchies
PACIFICVIS '09 Proceedings of the 2009 IEEE Pacific Visualization Symposium
On balloon drawings of rooted trees
GD'05 Proceedings of the 13th international conference on Graph Drawing
Inverse queries: how to get this answer?
i-KNOW '11 Proceedings of the 11th International Conference on Knowledge Management and Knowledge Technologies
Hi-index | 0.00 |
How to visualize datasets hierarchically structured is a basic issue in information visualization. Compared to the common diagrams based on the nodes-links paradigm (e.g. trees), the enclosure-based methods have shown high potential to represent simultaneously the structure of the hierarchy and the weight of nodes. In addition, these methods often support scalability up to sizes where trees become very complicated to understand. Several approaches belong to this class of visualization methods such as treemaps, ellimaps, circular treemaps or Voronoi treemaps. This paper focuses on the specific case of ellimaps in which the nodes are represented by ellipses nested one into each other. A controlled experiment has previously shown that the initial version of the ellimaps was efficient to support the perception of the dataset structure and was reasonably acceptable for the perception of the node weights. However it suffers from a major drawback in terms of display space occupation. We have tackled this issue and the paper proposes a new algorithm to draw ellimaps. It is based on successive distortions and relocations of the ellipses in order to occupy a larger proportion of the display space than the initial algorithm. A Monte-Carlo simulation has been used to evaluate the filling ratio of the display space in this new approach. The results show a significant improvement of this factor.