Issue No.12 - Dec. (2011 vol.17)
David Selassie , Stanford University
Brandon Heller , Stanford University
Jeffrey Heer , Stanford University
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2011.190
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.
Graph visualization, aggregation, node-link diagrams, edge bundling, physical simulation.
David Selassie, Brandon Heller, Jeffrey Heer, "Divided Edge Bundling for Directional Network Data", IEEE Transactions on Visualization & Computer Graphics, vol.17, no. 12, pp. 2354-2363, Dec. 2011, doi:10.1109/TVCG.2011.190