DocumentCode
1365653
Title
Divided Edge Bundling for Directional Network Data
Author
Selassie, David ; Heller, Brandon ; Heer, Jeffrey
Author_Institution
Comput. Sci. Dept., Stanford Univ., Stanford, CA, USA
Volume
17
Issue
12
fYear
2011
Firstpage
2354
Lastpage
2363
Abstract
The node-link diagram is an intuitive and venerable way to depict a graph. To reduce clutter and improve the readability of node-link views, Holten & van Wijk´s force-directed edge bundling employs a physical simulation to spatially group graph edges. While both useful and aesthetic, this technique has shortcomings: it bundles spatially proximal edges regardless of direction, weight, or graph connectivity. As a result, high-level directional edge patterns are obscured. We present divided edge bundling to tackle these shortcomings. By modifying the forces in the physical simulation, directional lanes appear as an emergent property of edge direction. By considering graph topology, we only bundle edges related by graph structure. Finally, we aggregate edge weights in bundles to enable more accurate visualization of total bundle weights. We compare visualizations created using our technique to standard force-directed edge bundling, matrix diagrams, and clustered graphs; we find that divided edge bundling leads to visualizations that are easier to interpret and reveal both familiar and previously obscured patterns.
Keywords
data visualisation; directed graphs; matrix algebra; pattern clustering; clustered graphs; directed edge bundling; directional edge patterns; directional network data; graph connectivity; graph theory; graph topology; matrix diagrams; node link diagram; visualization; Data visualization; Encoding; Graphics; Image edge detection; Graph visualization; aggregation; edge bundling; node-link diagrams; physical simulation.;
fLanguage
English
Journal_Title
Visualization and Computer Graphics, IEEE Transactions on
Publisher
ieee
ISSN
1077-2626
Type
jour
DOI
10.1109/TVCG.2011.190
Filename
6065002
Link To Document