Holten Danny
Technische Universiteit Eindhoven.
IEEE Trans Vis Comput Graph. 2006 Sep-Oct;12(5):741-8. doi: 10.1109/TVCG.2006.147.
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.
复合图是一种经常遇到的数据集类型。给出了项目之间的关系，并且还在项目上定义了层次结构。我们提出了一种用于可视化此类复合图的新方法。我们的方法基于将邻接边（即非层次边）视觉捆绑在一起。我们通过以下方式实现这一点。我们假设层次结构是通过标准树可视化方法显示的。接下来，我们将每个建模为B样条曲线的邻接边朝着由从一个节点到另一个节点的包含边所定义的路径的折线弯曲。这种层次捆绑减少了视觉混乱，并且还可视化了父节点之间隐式的邻接边，这些邻接边是其各自子节点之间显式邻接边的结果。此外，层次边捆绑是一种通用方法，可以与现有的树可视化技术结合使用。我们通过提供示例可视化来说明我们的技术，并根据此类可视化的潜在用户提供的非正式评估来讨论结果。
