The Community for Technology Leaders
Green Image
Issue No. 12 - Dec. (2011 vol. 17)
ISSN: 1077-2626
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
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.
Dynamic graph visualization, graph splatting, software visualization, software evolution.

D. Weiskopf, S. Diehl, F. Beck, C. Vehlow and M. Burch, "Parallel Edge Splatting for Scalable Dynamic Graph Visualization," in IEEE Transactions on Visualization & Computer Graphics, vol. 17, no. , pp. 2344-2353, 2011.
84 ms
(Ver 3.3 (11022016))