By Topic

SideKnot: Revealing relation patterns for graph visualization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Dichao Peng ; State Key Lab. of CAD&CG, Zhejiang Univ., Hangzhou, China ; Neng Lu ; Wei Chen ; Qunsheng Peng

Graph is an intuitive and powerful tool to present relationships between entities. Efficiently visualizing graphs with node-link diagrams is a great challenge due to visual clutter induced by edge crossing and node-edge overlapping. Many edge bundling methods are proposed to disclose high-level edge patterns. Though previous methods can successfully reveal the coarse graph structure, the relation patterns at individual node level can be overlooked. In addition, many edge bundling algorithms are computationally complex to prevent them from scaling up for extremely large graphs. In this paper, we propose SideKnot, an efficient node-based bundling method to cluster and knot edges. SideKnot is light, runs faster than most existing algorithms, and can disclose the relation patterns of an individual node such as its standing in the graph and pattern of relations with its neighbors.

Published in:

Pacific Visualization Symposium (PacificVis), 2012 IEEE

Date of Conference:

Feb. 28 2012-March 2 2012