The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - Dec. (2011 vol.17)
pp: 2354-2363
David Selassie , Stanford University
Brandon Heller , Stanford University
Jeffrey Heer , Stanford University
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.
INDEX TERMS
Graph visualization, aggregation, node-link diagrams, edge bundling, physical simulation.
CITATION
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
REFERENCES
[1] W. Cui, H. Zhou, H. Qu, P. C. Wong, and X. Li, Geometry-based edge clustering for graph visualization. IEEE Transactions on Visualization & Computer Graphics, 14 (6): 1277–1284, oct 2008.
[2] T. Dwyer, Scalable, versatile and simple constrained graph layout. Computer Graphics Forum, 28 (3): 991–998, 2009.
[3] G. Ellis and A. Dix, A Taxonomy of Clutter Reduction for Information Visualization. IEEE Transactions on Visualization & Computer Graphics, 13 (6): 1216–1223, 2007.
[4] J. Fekete, D. Wang, N. Dang, A. Aris, and C. Plaisant, Overlaying graph links on treemaps. IEEE Symposium on Information Visualization Conference Compendium (demonstration), 2003.
[5] E. Gansner, Y. Hu, S. North, and C. Scheidegger, Multilevel agglomerative edge bundling for visualizing large graphs. In Pacific Visualization Symposium (PacificVis), 2011 IEEE, pages 187–194, march 2011.
[6] M. Ghoniem, J. D. Fekete, and P. Castagliola, On the readability of graphs using node-link and matrix-based representations: a controlled experiment and statistical analysis. Information Visualization, 4 (2): 114–135, 2005.
[7] E. Hairer, C. Lubich, and G. Wanner, Geometric numerical integration illustrated by the St ormer-Verlet method. Acta Numerica, 12: 399–450, May 2003.
[8] B. Heller, E. Marschner, E. Rosenfeld, and J. Heer, Visualizing collaboration and influence in the open-source software community. In Mining Software Repositories, 2011.
[9] N. Henry, J.-D. Fekete, and M. J. McGuffin, NodeTrix: A hybrid visualization of social networks. In IEEE Transactions on Visualization & Computer Graphics, pages 1302–1309, 2007.
[10] D. Holten, Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Transactions on Visualization & Computer Graphics, 12 (5): 741–748, 2006.
[11] D. Holten, P. Isenberg, J. J. van Wijk, and J.-D. Fekete, An Extended Evaluation of the Readability of Tapered, Animated, and Textured Directed-Edge Representations in Node-Link Graphs. In 2011 IEEE Pacific Visualization Symposium (PacificVis), pages 195–202. IEEE, 2011.
[12] D. Holten and J. J. van Wijk, Force-Directed Edge Bundling for Graph Visualization. Computer Graphics Forum (Proc. EuroVis), 28 (3): 983–990, Jan 2009.
[13] D. Holten and J. J. van Wijk, A user study on visualizing directed edges in graphs. In ACM CHI, pages 2299–2308, 2009.
[14] M. Kaufmann and D. Wagner editors. , Drawing Graphs: Methods and Models (Lecture Notes in Computer Science). Springer, Berlin, 2001.
[15] A. Lambert, R. Bourqui, and D. Auber, Winding Roads: Routing edges into bundles. Computer Graphics Forum (Proc. EuroVis), 29 (3): 853–862, Jan 2010.
[16] F. van Ham, H.-J. Schulz, and J. Dimicco, Honeycomb: Visual analysis of large scale social networks. In INTERACT, volume 5727 of Lecture Notes in Computer Science, pages 429–442. Springer Berlin/Heidelberg, 2009.
[17] C. Ware Information Visualization: Perception for Design.Morgan-Kaufmann, 2004.
[18] N. Wong, Using edge plucking for interactive graph exploration. In IEEE InfoVis Posters, 2005.
[19] N. Wong, S. Carpendale, and S. Greenberg, Edgelens: an interactive method for managing edge congestion in graphs. In Information Visualization, 2003. INFOVIS 2003. IEEE Symposium on, pages 51 –58, oct. 2003.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool