Visualization Symposium, IEEE Pacific (2011)
Hong Kong, China
Mar. 1, 2011 to Mar. 4, 2011
Graphs are often used to encapsulate relationships between objects. Node-link diagrams, commonly used to visualize graphs, suffer from visual clutter on large graphs. Edge bundling is an effective technique for alleviating clutter and revealing high-level edge patterns. Previous methods for general graph layouts either require a control mesh to guide the bundling process, which can introduce high variation in curvature along the bundles, or all-to-all force and compatibility calculations, which is not scalable. We propose a multilevel agglomerative edge bundling method based on a principled approach of minimizing ink needed to represent edges, with additional constraints on the curvature of the resulting splines. The proposed method is much faster than previous ones, able to bundle hundreds of thousands of edges in seconds, and one million edges in a few minutes.
graph theory, data visualisation, graph layout, multilevel agglomerative edge bundling, large graph visualization, node-link diagram, Ink, Turning, Layout, Spline, Image edge detection, Visualization, Clutter, graph drawing, Edge bundling, multilevel, clustering
"Multilevel agglomerative edge bundling for visualizing large graphs", Visualization Symposium, IEEE Pacific, vol. 00, no. , pp. 187-194, 2011, doi:10.1109/PACIFICVIS.2011.5742389