Smooth bundling of large streaming and sequence graphs

Abstract : Dynamic graphs are increasingly pervasive in modern information systems. However, understanding how a graph changes in time is difficult. We present here two techniques for simplified visualization of dynamic graphs using edge bundles. The first technique uses a recent image-based graph bundling method to create smoothly changing bundles from streaming graphs. The second technique incorporates additional edge-correspondence data and is thereby suited to visualize discrete graph sequences. We illustrate our methods with examples from real-world large dynamic graph datasets.
Document type :
Conference papers
Complete list of metadatas

Cited literature [42 references]  Display  Hide  Download

https://hal-enac.archives-ouvertes.fr/hal-00878680
Contributor : Laurence Porte <>
Submitted on : Wednesday, October 30, 2013 - 3:29:04 PM
Last modification on : Thursday, October 17, 2019 - 8:55:00 AM
Long-term archiving on : Friday, April 7, 2017 - 7:19:23 PM

File

Hurter_PacificVis2013.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Christophe Hurter, Ozan Ersoy, Alexandru Telea. Smooth bundling of large streaming and sequence graphs. PacificVis 2013, 6th IEEE Pacific Visualization Symposium, Feb 2013, Sydney, Australia. pp 41-48, ⟨10.1109/PacificVis.2013.6596126⟩. ⟨hal-00878680⟩

Share

Metrics

Record views

353

Files downloads

644