The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - Dec. (2011 vol.17)
pp: 2344-2353
Michael Burch , VISUS, University of Stuttgart
Corinna Vehlow , VISUS, University of Stuttgart
Fabian Beck , University of Trier
Stephan Diehl , University of Trier
Daniel Weiskopf , VISUS, University of Stuttgart
ABSTRACT
We present a novel dynamic graph visualization technique based on node-link diagrams. The graphs are drawn side-byside from left to right as a sequence of narrow stripes that are placed perpendicular to the horizontal time line. The hierarchically organized vertices of the graphs are arranged on vertical, parallel lines that bound the stripes; directed edges connect these vertices from left to right. To address massive overplotting of edges in huge graphs, we employ a splatting approach that transforms the edges to a pixel-based scalar field. This field represents the edge densities in a scalable way and is depicted by non-linear color mapping. The visualization method is complemented by interaction techniques that support data exploration by aggregation, filtering, brushing, and selective data zooming. Furthermore, we formalize graph patterns so that they can be interactively highlighted on demand. A case study on software releases explores the evolution of call graphs extracted from the JUnit open source software project. In a second application, we demonstrate the scalability of our approach by applying it to a bibliography dataset containing more than 1.5 million paper titles from 60 years of research history producing a vast amount of relations between title words.
INDEX TERMS
Dynamic graph visualization, graph splatting, software visualization, software evolution.
CITATION
Michael Burch, Corinna Vehlow, Fabian Beck, Stephan Diehl, Daniel Weiskopf, "Parallel Edge Splatting for Scalable Dynamic Graph Visualization", IEEE Transactions on Visualization & Computer Graphics, vol.17, no. 12, pp. 2344-2353, Dec. 2011, doi:10.1109/TVCG.2011.226
REFERENCES
[1] D. Archambault, H. Purchase, and B. Pinaud, Animation, small multiples, and the effect of mental map preservation in dynamic graphs. IEEE Transactions on Visualization and Computer Graphics, 17 (4): 539–552, 2011.
[2] A. O. Artero, M. C. Ferreira de Oliveira, and H. Levkowitz, Uncovering clusters in crowded parallel coordinates visualizations. In Proceedings of the IEEE Symposium on Information Visualization, pages 81–88. IEEE Computer Society Press, 2004.
[3] F. Beck, M. Burch, and S. Diehl, Towards an aesthetic dimensions framework for dynamic graph visualisations. In Proceedings of Information Visualization (IV), pages 592–597. IEEE Computer Society Press, 2009.
[4] C. Bennett, J. Ryall, L. Spalteholz, and A. Gooch, The aesthetics of graph visualization. In Proceedings of Computational Aesthetics in Graphics, Visualization, and Imaging, pages 57–64. Eurographics Association, 2007.
[5] J. Blaas, C. Botha, and F. Post, Extensions of parallel coordinates for interactive exploration of large multi-timepoint data sets. IEEE Transactions on Visualization and Computer Graphics, 14 (6): 1436–1451, 2008.
[6] U. Brandes and S. R. Corman, Visual unrolling of network evolution and the analysis of dynamic discourse. Information Visualization, 2 (1): 40–50, 2003.
[7] M. Burch and S. Diehl, TimeRadarTrees: Visualizing dynamic compound digraphs. Computer Graphics Forum, 27 (3): 823–830, 2008.
[8] C. S. Collberg, S. G. Kobourov, J. Nagra, J. Pitts, and K. Wampler, A system for graph-based visualization of the evolution of software. In Proceedings of the ACM Symposium on Software Visualization, pages 77– 86. ACM Press, 2003.
[9] G. di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
[10] S. Diehl and C. Görg, Graphs, they are changing. In Proceedings of the International Symposium on Graph Drawing, pages 23–30. Springer, 2002.
[11] D. Feng, L. Kwock, Y. Lee, and R. M. Taylor II, Matching visual saliency to confidence in plots of uncertain data. Transactions on Visualization and Computer Graphics, 16 (6): 980–989, 2010.
[12] Y. Frishman and A. Tal, Online dynamic graph drawing. IEEE Transactions on Visualization and Computer Graphics, 14 (4): 727–740, 2008.
[13] O. Greevy, M. Lanza, and C. Wysseier, Visualizing live software systems in 3D. In Proceedings of the ACM Symposium on Software Visualization, pages 47–56. ACM Press, 2006.
[14] M. Greilich, M. Burch, and S. Diehl, Visualizing the evolution of compound digraphs with TimeArcTrees. Computer Graphics Forum, 28 (3): 975–982, 2009.
[15] J. Heinrich, S. Bachthaler, and D. Weiskopf, Progressive splatting of continuous scatterplots and parallel coordinates. Computer Graphics Forum, 30 (3): 653–662, 2011.
[16] J. Heinrich and D. Weiskopf, Continuous parallel coordinates. IEEE Transactions on Visualization and Computer Graphics, 15 (6): 1531– 1538, 2009.
[17] I. Herman, G. Melançon, and M. S. Marshall, Graph visualization and navigation in information visualization: A survey. IEEE Transactions on Visualization and Computer Graphics, 6 (1): 24–43, 2000.
[18] D. Holten, Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Transactions on Visualization and Computer Graphics, 12 (5): 741–748, 2006.
[19] D. Holten and J. J. van Wijk, Visual comparison of hierarchically organized data. Computer Graphics Forum, 27 (3): 759–766, 2008.
[20] D. Holten and J. J. van Wijk, Force-directed edge bundling for graph visualization. Computer Graphics Forum, 28 (3): 983–990, 2009.
[21] A. Inselberg and B. Dimsdale, Parallel coordinates: A tool for visualizing multi-dimensional geometry. In Proceedings of the IEEE Visualization Conference, pages 361–378. IEEE Computer Society Press, 1990.
[22] J. Johansson, P. Ljung, M. Jern, and M. Cooper, Revealing structure within clustered parallel coordinates displays. In Proceedings of the IEEE Symposium on Information Visualization, pages 125–132. IEEE Computer Society Press, 2005.
[23] J. Kruskal and J. Landwehr, Icicle plots: Better displays for hierarchical clustering. The American Statistician, 37 (2): 162–168, 1983.
[24] M. Lanza, The Evolution Matrix: Recovering software evolution using software visualization techniques. In Proceedings of the Fourth International Workshop on Principles of Software Evolution, pages 37–42. ACM Press, 2001.
[25] M. Ley, DBLP: Some lessons learned. Proceedings of Very Large Data Bases, 2 (2): 1493–1500, 2009.
[26] J. J. Miller and E. J. Wegman, Construction of line densities for parallel coordinate plots. In A. Buja, and P. A. Tukey editors, , Computing and Graphics in Statistics, pages 107–123. Springer, New York, 1991.
[27] M. Ogawa and K.-L. Ma, code_swarm: A design study in organic software visualization. IEEE Transactions on Visualization and Computer Graphics, 15 (6): 1097–1104, 2009.
[28] T. Porter and T. Duff, Compositing digital images. Computer Graphics (Proceedings of ACM SIGGRAPH), 18 (3): 253–259, 1984.
[29] R. Rosenholtz, Y. Li, J. Mansfield, and Z. Jin, Feature congestion: A measure of display clutter. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pages 761–770. ACM Press, 2005.
[30] B. Shneiderman, The eyes have it: A task by data type taxonomy for information visualizations. In Proceedings of the IEEE Symposium on Visual Languages, pages 336–343. IEEE Computer Society Press, 1996.
[31] W. Stevens, G. Myers, and L. Constantine, Structured design. IBM Systems Journal, 13 (2): 115–139, 1974.
[32] A. Telea and O. Ersoy, Image-based edge bundles: Simplified visualization of large graphs. Computer Graphics Forum, 29 (3): 843–852, 2010.
[33] B. Tversky, J. B. Morrison, and M. Bétrancourt, Animation: can it facilitate? International Journal on Human-Computer Studies, 57 (4): 247– 262, 2002.
[34] R. van Liere and W. C. de Leeuw, GraphSplatting: Visualizing graphs as continuous fields. IEEE Transactions on Visualization and Computer Graphics, 9 (2): 206–212, 2003.
[35] L. Voinea, A. Telea, and J. J. van Wijk, CVSScan: Visualization of code evolution. In Proceedings of the ACM Symposium on Software Visualization, pages 47–56. ACM Press, 2005.
[36] T. von Landesberger, A. Kuijper, T. Schreck, J. Kohlhammer, J. J. van Wijk, J.-D. Fekete, and D. W. Fellner, Visual analysis of large graphs. In Eurographics State-of-the-Art Reports, pages 37–60. Eurographics Association, 2010.
[37] C. Ware, H. C. Purchase, L. Colpoys, and M. McGill, Cognitive measurements of graph aesthetics. Information Visualization, 1 (2): 103–110, 2002.
[38] E. Wegman and Q. Luo, High dimensional clustering using parallel coordinates and the grand tour. Computing Science and Statistics, 28: 361– 368, 1997.
[39] P. C. Wong, P. Whitney, and J. Thomas, Visualizing association rules for text mining. In Proceedings of the IEEE Symposium on Information Visualization, pages 120–123. IEEE Computer Society Press, 1999.
[40] H. Zhou, W. Cui, H. Qu, Y. Wu, and Z. Z. Yuan, X. Splatting, the lines in parallel coordinates. Computer Graphics Forum, 28 (3): 759–766, 2009.
14 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool