The Community for Technology Leaders
Visualization Symposium, IEEE Pacific (2012)
Songdo, Korea (South)
Feb. 28, 2012 to Mar. 2, 2012
ISBN: 978-1-4673-0863-2
pp: 65-72
Dichao Peng , State Key Lab of CAD&CG, Zhejiang University, China
Qunsheng Peng , State Key Lab of CAD&CG, Zhejiang University, China
Neng Lu , State Key Lab of CAD&CG, Zhejiang University, China
Wei Chen , State Key Lab of CAD&CG, Zhejiang University, China
ABSTRACT
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.
INDEX TERMS
CITATION
Dichao Peng, Qunsheng Peng, Neng Lu, Wei Chen, "SideKnot: Revealing relation patterns for graph visualization", Visualization Symposium, IEEE Pacific, vol. 00, no. , pp. 65-72, 2012, doi:10.1109/PacificVis.2012.6183575
95 ms
(Ver 3.3 (11022016))