2019
DOI: 10.1109/tvcg.2018.2865265
|View full text |Cite
|
Sign up to set email alerts
|

Temporal Treemaps: Static Visualization of Evolving Trees

Abstract: We consider temporally evolving trees with changing topology and data: tree nodes may persist for a time range, merge or split, and the associated data may change. Essentially, one can think of this as a time series of trees with a node correspondence per hierarchy level between consecutive time steps. Existing visualization approaches for such data include animated 2D treemaps, where the dynamically changing layout makes it difficult to observe the data in its entirety. We present a method to visualize this d… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
44
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(44 citation statements)
references
References 36 publications
0
44
0
Order By: Relevance
“…[19,21,44,46,48,52]), and dynamic topology (e.g. [26,29]). Cui et al employ dynamic simplification of hierarchies evolving over time, with the ability to interactively zoom to lower levels of detail [7].…”
Section: Visual Comparisonmentioning
confidence: 99%
“…[19,21,44,46,48,52]), and dynamic topology (e.g. [26,29]). Cui et al employ dynamic simplification of hierarchies evolving over time, with the ability to interactively zoom to lower levels of detail [7].…”
Section: Visual Comparisonmentioning
confidence: 99%
“…The GO-NTG algorithm then processes these abstractions during post hoc analysis to compute NTGs, where the layout is derived with the algorithm of Lukasczyk et al [19]. Recently, Köpp et al [16] proposed an improved layout algorithm that could be used instead.…”
Section: Related Workmentioning
confidence: 99%
“…GenerateImages( K, f , T t , φ t , ψ t , C, L, P, n ) 1 // Get branches sorted by persistence in descending order 2 B ← ComputeBranchDecomposition( T , ψ t ) 3 // Create groups for the first n most persistent branches 4 G ← / 0 5 for i ← 0 to n − 1 do 6 NewGroup( G, B i ) 7 // Add remaining branches to closest group8 for i ← n to |B| do ← GetMostPersistentAttachedBranch( B, B i , ψ t ) ← GetGroup( G, B ) 11AddToGroup( G, B i ) 12 // Generate group images for all persistence intervals and levels13 foreach group G ∈ G do14 foreach threshold p i ∈ P where p i = max(P) do Filter grouped branches by persistence16 …”
mentioning
confidence: 99%
“…17,18 A static visualization for dynamic trees, based on the popular treemap convention is proposed by Köpp and Weinkauf. 19…”
Section: Related Workmentioning
confidence: 99%