Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data
Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data
复制标题
DOI：
10.1109/tvcg.2006.147
复制
发表时间：
2006-09-01
影响因子：
5.2
通讯作者：
Holten, Danny
中科院分区：
文献类型：
--
作者：
Holten, Danny
复合图是一种常见的数据集类型。给出了项目之间的关系，并在项目上定义了层次结构。我们提出了一种可视化复合图的新方法。我们的方法是基于视觉上将邻接边（即非分层边）捆绑在一起。我们认识到这一点如下。我们假设层次结构是通过标准的树可视化方法显示的。接下来，我们弯曲每个邻接边，建模为b样条曲线，朝向通过包含边从一个节点到另一个节点的路径定义的折线。这种分层捆绑减少了视觉混乱，并且还可视化了父节点之间的隐式邻接边，这些邻接边是它们各自子节点之间显式邻接边的结果。此外，分层边缘捆绑是一种通用的方法，可以与现有的树可视化技术结合使用。我们通过提供可视化示例来说明我们的技术，并根据此类可视化的潜在用户提供的非正式评估来讨论结果。
A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non-hierarchical edges, together. We realize this as follows. We assume that the hierarchy is shown via a standard tree visualization method. Next, we bend each adjacency edge, modeled as a B-spline curve, toward the polyline defined by the path via the inclusion edges from one node to another. This hierarchical bundling reduces visual clutter and also visualizes implicit adjacency edges between parent nodes that are the result of explicit adjacency edges between their respective child nodes. Furthermore, hierarchical edge bundling is a generic method which can be used in conjunction with existing tree visualization techniques. We illustrate our technique by providing example visualizations and discuss the results based on an informal evaluation provided by potential users of such visualizations.