Edge Equalized Treemaps
Edge Equalized Treemaps
复制标题
DOI：
10.1109/iv.2012.12
复制
发表时间：
2012-07
期刊：
影响因子：
--
通讯作者：
Aimi Kobayashi;Kazuo Misue;J. Tanaka
中科院分区：
文献类型：
--
作者：
Aimi Kobayashi;Kazuo Misue;J. Tanaka
树形图是一种分层结构的可视化方法，其中节点被绘制为矩形并以嵌套样式排列。已经开发了树形图的几种变体来表示不同类型的数据。在本文中，我们提出了一种边缘均衡树图，这是一种在叶子矩形中嵌入可视数据（例如条形图）的表示形式。该表示的特点是宽度相等的叶子矩形。由于它们的宽度相等，因此叶子矩形中图表的比例间隔可以统一，这意味着我们可以通过查看图表来比较图表。我们将边缘均衡树图与现有布局方法进行比较，并证明我们方法的实用性。
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.