National Taiwan University, Taipei, Taiwan.
IEEE Trans Vis Comput Graph. 2012 May;18(5):810-21. doi: 10.1109/TVCG.2011.104.
Graph visualization has been widely used to understand and present both global structural and local adjacency information in relational data sets (e.g., transportation networks, citation networks, or social networks). Graphs with dense edges, however, are difficult to visualize because fast layout and good clarity are not always easily achieved. When the number of edges is large, edge bundling can be used to improve the clarity, but in many cases, the edges could be still too cluttered to permit correct interpretation of the relations between nodes. In this paper, we present an ambiguity-free edge-bundling method especially for improving local detailed view of a complex graph. Our method makes more efficient use of display space and supports detail-on-demand viewing through an interactive interface. We demonstrate the effectiveness of our method with public coauthorship network data.
图形可视化已被广泛用于理解和呈现关系型数据集(如交通网络、引文网络或社交网络)中的全局结构和局部邻接信息。然而,具有密集边的图形很难可视化,因为快速布局和良好的清晰度并不总是容易实现。当边的数量很大时,可以使用边捆绑来提高清晰度,但在许多情况下,边仍然太杂乱,无法正确解释节点之间的关系。在本文中,我们提出了一种无歧义的边捆绑方法,特别是用于改善复杂图形的局部详细视图。我们的方法更有效地利用显示空间,并通过交互式界面支持按需查看详细信息。我们使用公共合著网络数据演示了我们方法的有效性。