Edge Equalized Treemaps

Aimi Kobayashi, Kazuo Misue, Jiro Tanaka
2012 2012 16th International Conference on Information Visualisation  
Treemap is a visualization method for hierarchical structures in which nodes are drawn as rectangles and arranged in a nested style. Several variations of Treemap have been developed to represent different types of data. In this paper, we propose an Edge Equalized Treemap, a representation that embeds visual data such as a bar chart in leaf rectangles. This representation is characterized by leaf rectangles of equal widths. Because their widths are equal, the scale intervals of charts in a leaf
more » ... rectangle can be unified, meaning that we can compare charts simply by looking at them. We compare the Edge Equalized Treemap with existing layout methods, and demonstrate the usefulness of our approach.
doi:10.1109/iv.2012.12 dblp:conf/iv/KobayashiMT12 fatcat:i5wmrh4lj5cupjdrlfgfzguv3q