GD'11 Proceedings of the 19th international conference on Graph Drawing
TGI-EB: a new framework for edge bundling integrating topology, geometry and importance
GD'11 Proceedings of the 19th international conference on Graph Drawing
Edge routing with ordered bundles
GD'11 Proceedings of the 19th international conference on Graph Drawing
Exploring the design space of interactive link curvature in network diagrams
Proceedings of the International Working Conference on Advanced Visual Interfaces
Graph Bundling by Kernel Density Estimation
Computer Graphics Forum
Progress on partial edge drawings
GD'12 Proceedings of the 20th international conference on Graph Drawing
StreamEB: stream edge bundling
GD'12 Proceedings of the 20th international conference on Graph Drawing
Time-space varying visual analysis of micro-blog sentiment
Proceedings of the 6th International Symposium on Visual Information Communication and Interaction
Hi-index | 0.00 |
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.