Journal article 476 views 32 downloads
Event‐based Dynamic Graph Drawing without the Agonizing Pain
,
S. Miksch ,
Daniel Archambault
Computer Graphics Forum, Volume: 41, Issue: 6, Pages: 226 - 244
Swansea University Author:
Daniel Archambault
-
PDF | Version of Record
© 2022 The Authors. This is an open access article under the terms of the Creative Commons Attribution License
Download (1.92MB)
DOI (Published version): 10.1111/cgf.14615
Abstract
Temporal networks can naturally model real-world complex phenomena such as contact networks, information dissemination and physical proximity. However, nodes and edges bear real-time coordinates, making it difficult to organize them into discrete timeslices, without a loss of temporal information du...
| Published in: | Computer Graphics Forum |
|---|---|
| ISSN: | 0167-7055 1467-8659 |
| Published: |
Wiley
2022
|
| Online Access: |
Check full text
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa60330 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract: |
Temporal networks can naturally model real-world complex phenomena such as contact networks, information dissemination and physical proximity. However, nodes and edges bear real-time coordinates, making it difficult to organize them into discrete timeslices, without a loss of temporal information due to projection. Event-based dynamic graph drawing rejects the notion of a timeslice and allows each node and edge to retain its own real-valued time coordinate. While existing work has demonstrated clear advantages for this approach, they come at a running time cost. We investigate the problem of accelerating event-based layout to make it more competitive with existing layout techniques. In this paper, we describe the design, implementation and experimental evaluation of MultiDynNoS, the first multi-level event-based graph layout algorithm. We consider three operators for coarsening and placement, inspired by Walshaw, GRIP and FM3, which we couple with an event-based graph drawing algorithm. We also propose two extensions to the core algorithm: AutoTau and Bend Transfer. We perform two experiments: first, we compare MultiDynNoS variants to existing state-of-the-art dynamic graph layout approaches; second, we investigate the impact of each of the proposed algorithm extensions. MultiDynNoS proves to be competitive with existing approaches, and the proposed extensions achieve their design goals and contribute in opening new research directions. |
|---|---|
| Keywords: |
Visualization, Graph Drawing, Temporal Networks |
| College: |
Faculty of Science and Engineering |
| Funders: |
The authors acknowledge TU Wien Bibliothek for financial supportthrough its Open Access Funding Programme. |
| Issue: |
6 |
| Start Page: |
226 |
| End Page: |
244 |