Journal article 773 views 266 downloads
Event-Based Dynamic Graph Visualisation
,
Stephen G. Kobourov
IEEE Transactions on Visualization and Computer Graphics, Pages: 1 - 1
Swansea University Author:
Daniel Archambault
-
PDF | Accepted Manuscript
Embargo date to allow accepted preprint to go live on IEEE Explore
Download (1.74MB) -
PDF | Version of Record
Released under the terms of a Creative Commons Attribution 3.0 License (CC-BY).
Download (1.7MB)
DOI (Published version): 10.1109/TVCG.2018.2886901
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 conf...
| Published in: | IEEE Transactions on Visualization and Computer Graphics |
|---|---|
| ISSN: | 1077-2626 1941-05062160-9306 |
| Published: |
2018
|
| Online Access: |
Check full text
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa47911 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| 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. |
|---|---|
| Keywords: |
Information Visualisation, Graph Drawing, Dynamic Graphs, Event-Based Analytics, No Timeslices. |
| College: |
Faculty of Science and Engineering |
| Funders: |
UKRI, EP/N005724/1 |
| Start Page: |
1 |
| End Page: |
1 |