Journal
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
Volume 26, Issue 7, Pages 2373-2386Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TVCG.2018.2886901
Keywords
Heuristic algorithms; Data visualization; Dynamics; Three-dimensional displays; Computational modeling; Layout; Animation; Information visualisation; graph drawing; dynamic graphs; event-based analytics; no timeslices
Categories
Funding
- EPSRC [EP/N005724/1]
- NSF [CCF-1712119, CCF-1740858, DMS-1839274]
- EPSRC [EP/N005724/1] Funding Source: UKRI
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available