The Community for Technology Leaders
Green Image
Issue No. 05 - May (2012 vol. 18)
ISSN: 1077-2626
pp: 810-821
Sheng-Jie Luo , Nat. Taiwan Univ., Taipei, Taiwan
Chun-Liang Liu , Nat. Taiwan Univ., Taipei, Taiwan
Bing-Yu Chen , Nat. Taiwan Univ., Taipei, Taiwan
Kwan-Liu Ma , Dept. of Comput. Sci., Univ. of California, Davis, CA, USA
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.
graph theory, data visualisation, dense graph edge, ambiguity-free edge-bundling method, interactive graph visualization, global structural adjacency information, local adjacency information, relational data set, complex graph, display space, detail-on-demand viewing, interactive interface, public coauthorship network data, transportation network, citation network, social network, Image edge detection, Visualization, Layout, Clutter, Data visualization, Routing, Social network services, interactive navigation., Graph visualization, network visualization, edge ambiguity, edge congestion, edge bundling, detail-on-demand

Bing-Yu Chen, Chun-Liang Liu, Sheng-Jie Luo and Kwan-Liu Ma, "Ambiguity-Free Edge-Bundling for Interactive Graph Visualization," in IEEE Transactions on Visualization & Computer Graphics, vol. 18, no. , pp. 810-821, 2012.
87 ms
(Ver 3.3 (11022016))