2014
DOI: 10.1109/tvcg.2013.246
|View full text |Cite
|
Sign up to set email alerts
|

Bundled Visualization of DynamicGraph and Trail Data

Abstract: Abstract-Depicting change captured by dynamic graphs and temporal paths, or trails, is hard. We present two techniques for simplified visualization of such datasets using edge bundles. The first technique uses an efficient image-based bundling method to create smoothly changing bundles from streaming graphs. The second technique adds edge-correspondence data atop of any static bundling algorithm, and is best suited for graph sequences. We show how these techniques can produce simplified visualizations of strea… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
87
0
1

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
4
1

Relationship

2
8

Authors

Journals

citations
Cited by 70 publications
(88 citation statements)
references
References 54 publications
(102 reference statements)
0
87
0
1
Order By: Relevance
“…Here, δ is a distance metric between R d curves, e.g., Hausdorff distance [19]; and κ reflects the dissimilarity of two paths γ i and γ j , which always considers the distance δ between paths, but can also consider path type, weights, timestamps, or directions [31,63]. Simply put, Eqn.…”
Section: Notations and Related Workmentioning
confidence: 99%
“…Here, δ is a distance metric between R d curves, e.g., Hausdorff distance [19]; and κ reflects the dissimilarity of two paths γ i and γ j , which always considers the distance δ between paths, but can also consider path type, weights, timestamps, or directions [31,63]. Simply put, Eqn.…”
Section: Notations and Related Workmentioning
confidence: 99%
“…This problem is especially severe when many time moments or large/dense graphs need to be analyzed. Approaches mitigating this problem include reducing the number of time steps and highlighting of changes between consecutive graphs [9], usage of smooth edge bundling [34], drawing of clustered graphs or filtered graphs [1,24]. These approaches still suffer from animation perception problems.…”
Section: Related Workmentioning
confidence: 99%
“…Using bundling algorithm, flow lines which are close to each other, are rerouted to form a bundle (Fig. 3.) (Boyandin 2013) (Hurter et al 2014); • Representations, for example, animation of movements over time (Fig. 4.…”
Section: Data Complexity and Visual Cluttermentioning
confidence: 99%