Journal of Parallel and Distributed Computing
Tree visualization with tree-maps: 2-d space-filling approach
ACM Transactions on Graphics (TOG)
Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies
ACM Transactions on Graphics (TOG)
TennisViewer: A Browser for Competition Trees
IEEE Computer Graphics and Applications
Voronoi treemaps for the visualization of software metrics
SoftVis '05 Proceedings of the 2005 ACM symposium on Software visualization
INFOVIS '05 Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization
A Note on Space-Filling Visualizations and Space-Filling Curves
INFOVIS '05 Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization
Visualizing Business Data with Generalized Treemaps
IEEE Transactions on Visualization and Computer Graphics
Circular partitions with applications to visualization and embeddings
Proceedings of the twenty-fourth annual symposium on Computational geometry
Perceptual Guidelines for Creating Rectangular Treemaps
IEEE Transactions on Visualization and Computer Graphics
| Hi-index | 0.00 |
Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree T where the weight of each node is the sum of the weights of its children. A treemap for T is a hierarchical partition of a rectangle into simply connected regions, usually rectangles. Each region represents a node of T and its area is proportional to the weight of the corresponding node. An important quality criterion for treemaps is the aspect ratio of its regions. One cannot bound the aspect ratio if the regions are restricted to be rectangles. In contrast, polygonal partitions, that use convex polygons, can have bounded aspect ratio. We are the first to obtain convex partitions with optimal aspect ratio O(depth(T)). However, depth(T) still depends on the input tree. Hence we introduce a new type of treemaps, namely orthoconvex treemaps, where regions representing leaves are rectangles, L-, and S-shapes, and regions representing internal nodes are orthoconvex polygons. We prove that any input tree, irrespective of the weights of the nodes and the depth of the tree, admits an orthoconvex treemap of constant aspect ratio. We also obtain several specialized results for single-level treemaps, that is, treemaps where the input tree has depth 1.