Edge equalized treemaps

Aimi Kobayashi*, Kazuo Misue, Jiro Tanaka

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)


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 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.

Original languageEnglish
Title of host publication2012 16th International Conference on Information Visualisation, IV 2012
Number of pages6
Publication statusPublished - 2012 Oct 31
Externally publishedYes
Event2012 16th International Conference on Information Visualisation, IV 2012 - Montpellier, France
Duration: 2012 Jul 112012 Jul 13

Publication series

NameProceedings of the International Conference on Information Visualisation
ISSN (Print)1093-9547


Other2012 16th International Conference on Information Visualisation, IV 2012


  • Charts with Orthogonal Coordinate Axes
  • Equalized Edges
  • Hierarchies
  • Treemap
  • Visualization

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition


Dive into the research topics of 'Edge equalized treemaps'. Together they form a unique fingerprint.

Cite this