Visualizing the Evolution of Compound Digraphs with TimeArcTrees
| dc.contributor.author | Greilich, Martin | en_US |
| dc.contributor.author | Burch, Michael | en_US |
| dc.contributor.author | Diehl, Stephan | en_US |
| dc.contributor.editor | H.-C. Hege, I. Hotz, and T. Munzner | en_US |
| dc.date.accessioned | 2014-02-21T19:50:57Z | |
| dc.date.available | 2014-02-21T19:50:57Z | |
| dc.date.issued | 2009 | en_US |
| dc.description.abstract | Compound digraphs are a widely used model in computer science. In many application domains these models evolve over time. Only few approaches to visualize such dynamic compound digraphs exist and mostly use animation to show the dynamics. In this paper we present a new visualization tool called TimeArcTrees that visualizes weighted, dynamic compound digraphs by drawing a sequence of node-link diagrams in a single view. Compactness is achieved by aligning the nodes of a graph vertically. Edge crossings are reduced by drawing upward and downward edges separately as colored arcs. Horizontal alignment of the instances of the same node in different graphs facilitates comparison of the graphs in the sequence. Many interaction techniques allow to explore the given graphs. Smooth animation supports the user to better track the transitions between views and to preserve his or her mental map. We illustrate the usefulness of the tool by looking at the particular problem of how shortest paths evolve over time. To this end, we applied the system to an evolving graph representing the German Autobahn and its traffic jams. | en_US |
| dc.description.number | 3 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 28 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2009.01451.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.title | Visualizing the Evolution of Compound Digraphs with TimeArcTrees | en_US |