Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data
IEEE Transactions on Visualization and Computer Graphics
Geometry-Based Edge Clustering for Graph Visualization
IEEE Transactions on Visualization and Computer Graphics
GD'06 Proceedings of the 14th international conference on Graph drawing
GD'07 Proceedings of the 15th international conference on Graph drawing
Improving layered graph layouts with edge bundling
GD'10 Proceedings of the 18th international conference on Graph drawing
Multilevel agglomerative edge bundling for visualizing large graphs
PACIFICVIS '11 Proceedings of the 2011 IEEE Pacific Visualization Symposium
Fast edge-routing for large graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
An improved algorithm for the metro-line crossing minimization problem
GD'09 Proceedings of the 17th international conference on Graph Drawing
On crossing minimization problem
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Winding roads: routing edges into bundles
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
Force-directed edge bundling for graph visualization
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
Exploring the design space of interactive link curvature in network diagrams
Proceedings of the International Working Conference on Advanced Visual Interfaces
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
We propose a new approach to edge bundling. At the first stage we route the edge paths so as to minimize a weighted sum of the total length of the paths together with their ink. As this problem is NP-hard, we provide an efficient heuristic that finds an approximate solution. The second stage then separates edges belonging to the same bundle. To achieve this, we provide a new and efficient algorithm that solves a variant of the metro-line crossing minimization problem. The method creates aesthetically pleasing edge routes that give an overview of the global graph structure, while still drawing each edge separately, without intersecting graph nodes, and with few crossings.