Abstract
Dynamic graph drawing algorithms take as input a series of timeslices that standard, force-directed algorithms can exploit to compute a layout. However, often dynamic graphs are expressed as a series of events where the nodes and edges have real coordinates along the time dimension that are not confined to discrete timeslices. Current techniques for dynamic graph drawing impose a set of timeslices on this event-based data in order to draw the dynamic graph, but it is unclear how many timeslices should be selected: too many timeslices slows the computation of the layout, while too few timeslices obscures important temporal features, such as causality. To address these limitations, we introduce a novel model for drawing event-based dynamic graphs and the first dynamic graph drawing algorithm, DynNoSlice, that is capable of drawing dynamic graphs in this model. DynNoSlice is an offline, force-directed algorithm that draws event-based, dynamic graphs in the space-time cube (2D+time). We also present a method to extract representative small multiples from the space-time cube. To demonstrate the advantages of our approach, DynNoSlice is compared with state-of-the-art timeslicing methods using a metrics-based experiment. Finally, we present case studies of event-based dynamic data visualised with the new model and algorithm.
| Original language | English (US) |
|---|---|
| Journal | IEEE Transactions on Visualization and Computer Graphics |
| DOIs | |
| State | Accepted/In press - Jan 1 2018 |
Fingerprint
Keywords
- Animation
- Computational modeling
- Data visualization
- Dynamic Graphs
- Dynamics
- Event-Based Analytics
- Graph Drawing
- Heuristic algorithms
- Information Visualisation
- Layout
- No Timeslices
- Three-dimensional displays
ASJC Scopus subject areas
- Software
- Signal Processing
- Computer Vision and Pattern Recognition
- Computer Graphics and Computer-Aided Design
Cite this
Event-Based Dynamic Graph Visualisation. / Simonetto, Paolo; Archambault, Daniel; Kobourov, Stephen G.
In: IEEE Transactions on Visualization and Computer Graphics, 01.01.2018.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Event-Based Dynamic Graph Visualisation
AU - Simonetto, Paolo
AU - Archambault, Daniel
AU - Kobourov, Stephen G
PY - 2018/1/1
Y1 - 2018/1/1
N2 - Dynamic graph drawing algorithms take as input a series of timeslices that standard, force-directed algorithms can exploit to compute a layout. However, often dynamic graphs are expressed as a series of events where the nodes and edges have real coordinates along the time dimension that are not confined to discrete timeslices. Current techniques for dynamic graph drawing impose a set of timeslices on this event-based data in order to draw the dynamic graph, but it is unclear how many timeslices should be selected: too many timeslices slows the computation of the layout, while too few timeslices obscures important temporal features, such as causality. To address these limitations, we introduce a novel model for drawing event-based dynamic graphs and the first dynamic graph drawing algorithm, DynNoSlice, that is capable of drawing dynamic graphs in this model. DynNoSlice is an offline, force-directed algorithm that draws event-based, dynamic graphs in the space-time cube (2D+time). We also present a method to extract representative small multiples from the space-time cube. To demonstrate the advantages of our approach, DynNoSlice is compared with state-of-the-art timeslicing methods using a metrics-based experiment. Finally, we present case studies of event-based dynamic data visualised with the new model and algorithm.
AB - Dynamic graph drawing algorithms take as input a series of timeslices that standard, force-directed algorithms can exploit to compute a layout. However, often dynamic graphs are expressed as a series of events where the nodes and edges have real coordinates along the time dimension that are not confined to discrete timeslices. Current techniques for dynamic graph drawing impose a set of timeslices on this event-based data in order to draw the dynamic graph, but it is unclear how many timeslices should be selected: too many timeslices slows the computation of the layout, while too few timeslices obscures important temporal features, such as causality. To address these limitations, we introduce a novel model for drawing event-based dynamic graphs and the first dynamic graph drawing algorithm, DynNoSlice, that is capable of drawing dynamic graphs in this model. DynNoSlice is an offline, force-directed algorithm that draws event-based, dynamic graphs in the space-time cube (2D+time). We also present a method to extract representative small multiples from the space-time cube. To demonstrate the advantages of our approach, DynNoSlice is compared with state-of-the-art timeslicing methods using a metrics-based experiment. Finally, we present case studies of event-based dynamic data visualised with the new model and algorithm.
KW - Animation
KW - Computational modeling
KW - Data visualization
KW - Dynamic Graphs
KW - Dynamics
KW - Event-Based Analytics
KW - Graph Drawing
KW - Heuristic algorithms
KW - Information Visualisation
KW - Layout
KW - No Timeslices
KW - Three-dimensional displays
UR - http://www.scopus.com/inward/record.url?scp=85058898178&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85058898178&partnerID=8YFLogxK
U2 - 10.1109/TVCG.2018.2886901
DO - 10.1109/TVCG.2018.2886901
M3 - Article
AN - SCOPUS:85058898178
JO - IEEE Transactions on Visualization and Computer Graphics
JF - IEEE Transactions on Visualization and Computer Graphics
SN - 1077-2626
ER -