Edge equalized treemaps

Aimi Kobayashi, Kazuo Misue, Jiro Tanaka

研究成果: Conference contribution

5 引用 (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.

元の言語English
ホスト出版物のタイトル2012 16th International Conference on Information Visualisation, IV 2012
ページ7-12
ページ数6
DOI
出版物ステータスPublished - 2012 10 31
イベント2012 16th International Conference on Information Visualisation, IV 2012 - Montpellier, France
継続期間: 2012 7 112012 7 13

出版物シリーズ

名前Proceedings of the International Conference on Information Visualisation
ISSN(印刷物)1093-9547

Other

Other2012 16th International Conference on Information Visualisation, IV 2012
France
Montpellier
期間12/7/1112/7/13

    フィンガープリント

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition

これを引用

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