Techniques de bundling : un cas d'étude pour l'exploration de grandes quantités d'informations

Abstract : We present a fast and simple method to compute bundled layouts of general graphs, dynamic graphs and temporal paths. For this, we first transform a given graph drawing into a density map using kernel density estimation. Next, we apply an image sharpening technique which progressively merges local height maxima by moving the convolved graph edges into the height gradient flow. We show how these techniques can produce simplified visualizations of static, streaming and sequence graphs. We illustrate our techniques with datasets from aircraft monitoring, software engineering, and eye-tracking of static and dynamic scenes.
Document type :
Conference papers
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal-enac.archives-ouvertes.fr/hal-00878689
Contributor : Laurence Porte <>
Submitted on : Thursday, November 14, 2013 - 7:00:15 AM
Last modification on : Friday, June 14, 2019 - 6:31:05 PM
Long-term archiving on : Saturday, February 15, 2014 - 4:29:19 AM

File

Hurter_VISU2013.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00878689, version 1

Collections

Citation

Christophe Hurter. Techniques de bundling : un cas d'étude pour l'exploration de grandes quantités d'informations. VISU 2013, Journée d'étude pour les communautés de visualisation scientifique (SciVis) et de visualisation d'information (InfoVis), Nov 2013, Paris, France. ⟨hal-00878689⟩

Share

Metrics

Record views

436

Files downloads

118