Attribute-Driven Edge Bundling for General Graphs with Applications in Trail Analysis

Abstract : Edge bundling methods reduce visual clutter of dense and occluded graphs. However, existing bundling techniques either ignore edge properties such as direction and data attributes, or are otherwise computationally not scalable, which makes them unsuitable for tasks such as exploration of large trajectory datasets. We present a new framework to generate bundled graph layouts according to any numerical edge attributes such as directions, timestamps or weights. We propose a GPU-based implementation linear in number of edges, which makes our algorithm applicable to large datasets. We demonstrate our method with applications in the analysis of aircraft trajectory datasets and eye-movement traces.
Document type :
Conference papers
Complete list of metadatas

Cited literature [45 references]  Display  Hide  Download

https://hal-enac.archives-ouvertes.fr/hal-01158976
Contributor : Laurence Porte <>
Submitted on : Tuesday, June 2, 2015 - 11:50:53 AM
Last modification on : Thursday, May 23, 2019 - 4:00:11 PM
Long-term archiving on : Tuesday, September 15, 2015 - 9:27:38 AM

File

ADEB-final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01158976, version 1

Collections

ENAC | LII

Citation

Vsevolod Peysakhovich, Christophe Hurter, Alexandru Telea. Attribute-Driven Edge Bundling for General Graphs with Applications in Trail Analysis. PacificVis 2015, 8th IEEE Pacific Visualization Symposium, Apr 2015, Hangzhou, China. ⟨hal-01158976⟩

Share

Metrics

Record views

143

Files downloads

278