|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM292049781 |
| 003 |
DE-627 |
| 005 |
20231225072228.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231225s2020 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TVCG.2018.2886901
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0973.xml
|
| 035 |
|
|
|a (DE-627)NLM292049781
|
| 035 |
|
|
|a (NLM)30575538
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Simonetto, Paolo
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Event-Based Dynamic Graph Visualisation
|
| 264 |
|
1 |
|c 2020
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Revised 01.06.2020
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a 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
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Archambault, Daniel
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Kobourov, Stephen
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on visualization and computer graphics
|d 1996
|g 26(2020), 7 vom: 19. Juli, Seite 2373-2386
|w (DE-627)NLM098269445
|x 1941-0506
|7 nnns
|
| 773 |
1 |
8 |
|g volume:26
|g year:2020
|g number:7
|g day:19
|g month:07
|g pages:2373-2386
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TVCG.2018.2886901
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 26
|j 2020
|e 7
|b 19
|c 07
|h 2373-2386
|