Show simple item record

dc.contributor.authorGreilich, Martinen_US
dc.contributor.authorBurch, Michaelen_US
dc.contributor.authorDiehl, Stephanen_US
dc.contributor.editorH.-C. Hege, I. Hotz, and T. Munzneren_US
dc.date.accessioned2014-02-21T19:50:57Z
dc.date.available2014-02-21T19:50:57Z
dc.date.issued2009en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/j.1467-8659.2009.01451.xen_US
dc.description.abstractCompound 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.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleVisualizing the Evolution of Compound Digraphs with TimeArcTreesen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume28en_US
dc.description.number3en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record