Dynamic Graph Visualization
Introduction
![]() |
Visualizing dynamic directed and weighted graphs with an additional hierarchical organization of the graph vertices is a challenging task. Many data dimensions have to be represented at the same time:
- the graph vertices
- the adjacency edges induced by the graph
- the weights of the adjacency edges
- the inclusion edges induced by the hierarchy
- the evolution of the graph over time
Traditional approaches use a time-to-time mapping and show the time-varying graph data as animated sequences of node-link diagrams. Though this visualization strategy is very intuitive it also has some drawbacks:
- if the graphs are very dense, i.e. have many edges, visual clutter occurs caused by many edge crossings
- animation leads to cognitive efforts for a viewer to preserve his mental map
- sophisticated layout algorithms are needed to circumwent the two former mentioned problems that have a high run time complexity
Research
In our research we avoid a time-to-time mapping and encode the time dimension into space instead. We use stacked graphical color coded elements to show weighted time-varying relations and we show links only implicitly by different orientations instead of direct explicit links as in node-link diagrams.
![]() |
![]() |
![]() |
Our approach allows to easily explore a time-varying graph data set for trends, countertrends, and anomalies and has many benefits:
- visual clutter is reduced by showing the links implicitly
- cognitive efforts are reduced and the mental map is preserved by using static images
- interactive features can easily be applied
- run time complexities are reduced and graphs can be added on-the-fly.
Publications
2013
|
Hlawatsch, Marcel; Sadlo, Filip; Burch, Michael; Weiskopf, Daniel: Scale-Stack Bar Charts. In: Computer Graphics Forum: No. 3 (2013) (to appear).
|
![]() |
Beck, Fabian; Burch, Michael; Diehl, Stephan: Matching Application Requirements with Dynamic Graph Visualization Profiles. In: IV '13 (to appear).
|
![]() |
Burch, Michael; Andrienko, Gennady L.; Andrienko, Natalia V.; Höferlin, Markus; Raschke, Michael; Weiskopf, Daniel: Visual Task Solution Strategies in Tree Diagrams. In: Proceedings of the IEEE PacificVIS 2013, pp. 169-176, 2013.
|
|
Vehlow, Corinna; Burch, Michael; Schmauder, Hansjörg; Weiskopf, Daniel: Radial Layered Matrix Visualization of Dynamic Graphs. In: Proceedings of 17th International Conference on Information Visualization (IV) (to appear).
|
2012
|
Müller, Christoph; Reina, Guido; Burch, Michael; Weiskopf, Daniel: Large-Scale Visualization Projects for Teaching Software Engineering. In: Computer Graphics and Applications: No. 4 (2012), pp. 14-19.
|
2011
|
Burch, Michael; Heinrich, Julian; Konevtsova, Natalia; Höferlin, Markus; Weiskopf, Daniel: Evaluation of Traditional, Orthogonal, and Radial Tree Diagrams by an Eye Tracking Study. In: IEEE Transactions on Visualization and Computer Graphics: No. 6 (2011), p. 2440–2448.
|
|
![]() |
Burch, Michael; Vehlow, Corinna; Beck, Fabian; Diehl, Stephan; Weiskopf, Daniel: Parallel Edge Splatting for Scalable Dynamic Graph Visualization. In: IEEE Transactions on Visualization and Computer Graphics: No. 12 (2011), pp. 2344-2353.
|
2010
![]() |
Diehl, Stephan; Beck, Fabian; Burch, Michael: Uncovering Strengths and Weaknesses of Radial Visualizations---an Empirical Approach. In: . IEEE Trans. Vis. Comput. Graph.: No. 6 (2010), pp. 935-942.
|
2009
![]() |
Greilich, Martin; Burch, Michael; Diehl, Stephan: Visualizing the Evolution of Compound Digraphs with TimeArcTrees. In: Comput. Graph. Forum: No. 3 (2009), pp. 975-982.
|
2008
|
Burch, Michael; Diehl, Stephan: Visualizing Dynamic Compound Digraphs. In: Comput. Graph. Forum: No. 3 (2008), pp. 823-830.
|




vis.uni-stuttgart.de

















