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

Parallel Edge Splatting for Scalable Dynamic Graph Visualization

Abstract: We present a novel dynamic graph visualization technique based on node-link diagrams. The graphs are drawn side-byside from left to right as a sequence of narrow stripes that are placed perpendicular to the horizontal time line. The hierarchically organized vertices of the graphs are arranged on vertical, parallel lines that bound the stripes; directed edges connect these vertices from left to right. To address massive overplotting of edges in huge graphs, we employ a splatting approach that transforms the edg… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
98
0
1

Year Published

2013
2013
2019
2019

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 159 publications
(100 citation statements)
references
References 33 publications
1
98
0
1
Order By: Relevance
“…However, 3D can be cluttered, and has occlusion and other perceptual limitations. An interesting 2D approach based on parallel coordinates was proposed by Burch et al [21], where vertices are ordered and positioned on several vertical parallel lines, and directed edges connect these vertices from left to right. The graph of each timestep is thus displayed between two consecutive vertical axes.…”
Section: Static Temporal Plotsmentioning
confidence: 99%
“…However, 3D can be cluttered, and has occlusion and other perceptual limitations. An interesting 2D approach based on parallel coordinates was proposed by Burch et al [21], where vertices are ordered and positioned on several vertical parallel lines, and directed edges connect these vertices from left to right. The graph of each timestep is thus displayed between two consecutive vertical axes.…”
Section: Static Temporal Plotsmentioning
confidence: 99%
“…In the specific case of graphs, a dynamic network [8,34] can evolve in different ways over time. Most previous approaches for visualizing dynamic graphs can be classified according to our own taxonomy in Figure 2, which shows each node with a changing color representing a numerical attribute.…”
Section: Related Work 21 Visualization Of Dynamic Graphsmentioning
confidence: 99%
“…For large graphs and/or a large number of time moments, a scalability challenge emerges. In the network visualization community, this is often mitigated by suitable node layouts [18]. This is however not applicable to geolocated graphs, as the understanding of geographic distribution is diminished.…”
Section: Related Workmentioning
confidence: 99%
“…Many people go to the center for work in the morning (around 9 o'clock) or move through the center for reaching their destinations. In the evening of working days (hours [18][19], working people move back from the center to the periphery, whereas some people move to the center (see Fig. 5).…”
Section: Mobility In Greater London Areamentioning
confidence: 99%