Shortest paths in Euclidean graphs
Algorithmica
A sweepline algorithm for Voronoi diagrams
SCG '86 Proceedings of the second annual symposium on Computational geometry
Approximation algorithms for NP-hard problems
The scientist and engineer's guide to digital signal processing
The scientist and engineer's guide to digital signal processing
Simulation of wrinkled surfaces
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Models of light reflection for computer synthesized pictures
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
Implementing a General-Purpose Edge Router
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
A Fast Adaptive Layout Algorithm for Undirected Graphs
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
GraphSplatting: Visualizing Graphs as Continuous Fields
IEEE Transactions on Visualization and Computer Graphics
Linear algebra operators for GPU implementation of numerical algorithms
ACM SIGGRAPH 2003 Papers
Metric-Based Network Exploration and Multiscale Scatterplot
INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
Interactive Visualization of Small World Graphs
INFOVIS '04 Proceedings of the IEEE Symposium on Information Visualization
Digital Image Processing (3rd Edition)
Digital Image Processing (3rd Edition)
INFOVIS '05 Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization
Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data
IEEE Transactions on Visualization and Computer Graphics
ASK-GraphView: A Large Scale Graph Visualization System
IEEE Transactions on Visualization and Computer Graphics
A Taxonomy of Clutter Reduction for Information Visualisation
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
EdgeLens: an interactive method for managing edge congestion in graphs
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
GD'05 Proceedings of the 13th international conference on Graph Drawing
Drawing large graphs with a potential-field-based multilevel algorithm
GD'04 Proceedings of the 12th international conference on Graph Drawing
Fast edge-routing for large graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Grouse: feature-based, steerable graph hierarchy exploration
EUROVIS'07 Proceedings of the 9th Joint Eurographics / IEEE VGTC conference on Visualization
Visualization of vessel movements
EuroVis'09 Proceedings of the 11th 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
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
An empirical study on the impact of edge bundling on user comprehension of graphs
Proceedings of the International Working Conference on Advanced Visual Interfaces
Pathway preserving representation of metabolic networks
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
StreamEB: stream edge bundling
GD'12 Proceedings of the 20th international conference on Graph Drawing
Drawing clustered graphs as topographic maps
GD'12 Proceedings of the 20th international conference on Graph Drawing
GPU based graph bundling using geographic reference information
ACM SIGGRAPH 2013 Posters
Hi-index | 0.00 |
Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of edges and their crossings. Consequently, it is difficult to read the relationships between nodes and the high-level edge patterns that may exist in standard nodelink diagram representations. Edge bundling techniques have been proposed to help solve this issue, which rely on high quality edge rerouting. In this paper, we introduce an intuitive edge bundling technique which efficiently reduces edge clutter in graphs drawings. Our method is based on the use of a grid built using the original graph to compute the edge rerouting. In comparison with previously proposed edge bundling methods, our technique improves both the level of clutter reduction and the computation performance. The second contribution of this paper is a GPU-based rendering method which helps users perceive bundles densities while preserving edge color.