Edge equalized treemaps

Aimi Kobayashi, Kazuo Misue, Jiro Tanaka

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

5 Citations (Scopus)

Abstract

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
Pages7-12
Number of pages6
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event2012 16th International Conference on Information Visualisation, IV 2012 - Montpellier, France
Duration: 2012 Jul 112012 Jul 13

Other

Other2012 16th International Conference on Information Visualisation, IV 2012
CountryFrance
CityMontpellier
Period12/7/1112/7/13

Fingerprint

Visualization

Keywords

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

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Software
  • Signal Processing

Cite this

Kobayashi, A., Misue, K., & Tanaka, J. (2012). Edge equalized treemaps. In 2012 16th International Conference on Information Visualisation, IV 2012 (pp. 7-12). [6295784] https://doi.org/10.1109/IV.2012.12

Edge equalized treemaps. / Kobayashi, Aimi; Misue, Kazuo; Tanaka, Jiro.

2012 16th International Conference on Information Visualisation, IV 2012. 2012. p. 7-12 6295784.

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

Kobayashi, A, Misue, K & Tanaka, J 2012, Edge equalized treemaps. in 2012 16th International Conference on Information Visualisation, IV 2012., 6295784, pp. 7-12, 2012 16th International Conference on Information Visualisation, IV 2012, Montpellier, France, 12/7/11. https://doi.org/10.1109/IV.2012.12
Kobayashi A, Misue K, Tanaka J. Edge equalized treemaps. In 2012 16th International Conference on Information Visualisation, IV 2012. 2012. p. 7-12. 6295784 https://doi.org/10.1109/IV.2012.12
Kobayashi, Aimi ; Misue, Kazuo ; Tanaka, Jiro. / Edge equalized treemaps. 2012 16th International Conference on Information Visualisation, IV 2012. 2012. pp. 7-12
@inproceedings{b9b05a879f31499197eace3a21218ca5,
title = "Edge equalized treemaps",
abstract = "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.",
keywords = "Charts with Orthogonal Coordinate Axes, Equalized Edges, Hierarchies, Treemap, Visualization",
author = "Aimi Kobayashi and Kazuo Misue and Jiro Tanaka",
year = "2012",
doi = "10.1109/IV.2012.12",
language = "English",
isbn = "9780769547718",
pages = "7--12",
booktitle = "2012 16th International Conference on Information Visualisation, IV 2012",

}

TY - GEN

T1 - Edge equalized treemaps

AU - Kobayashi, Aimi

AU - Misue, Kazuo

AU - Tanaka, Jiro

PY - 2012

Y1 - 2012

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

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

KW - Charts with Orthogonal Coordinate Axes

KW - Equalized Edges

KW - Hierarchies

KW - Treemap

KW - Visualization

UR - http://www.scopus.com/inward/record.url?scp=84867912471&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867912471&partnerID=8YFLogxK

U2 - 10.1109/IV.2012.12

DO - 10.1109/IV.2012.12

M3 - Conference contribution

SN - 9780769547718

SP - 7

EP - 12

BT - 2012 16th International Conference on Information Visualisation, IV 2012

ER -