Exploring the evolution of pressure-perturbations to understand atmospheric phenomena

Widanagamaachchi, Wathsala; Jacques, Alexander A.; Wang, Bei; Crosman, Erik T.; Bremer, Peer-Timo; Pascucci, Valerio; Horel, John D.

doi:10.1109/pacificvis.2017.8031584

Cited by 11 publications

(4 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thomas et al explore symmetry detecting using contour trees [39]. Widanagamaachchi et al study atmospheric phenomena by constructing a tracking on merge trees [42]. Yan et al compute a structural average of merge trees for understanding statistical properties of collections [44].…”

Section: Related Work 21 Graph-based Topological Descriptorsmentioning

confidence: 99%

Computing a Stable Distance on Merge Trees

Bollen,

Tennakoon,

Levine

2022

Preprint

View full text Add to dashboard Cite

Fig. 1. Starting with a baseline scalar field and merge tree, a small perturbation may change the topology of a merge tree. The top graph plots the bottleneck, merge tree matching, and L ∞ distance between the baseline and 36 perturbed scalar fields which all exhibit a horizontal instability. The merge tree matching distance is shown here to lie between the bottleneck distance and the L ∞ distance even when faced with these instabilities.

show abstract

Section: Related Work 21 Graph-based Topological Descriptorsmentioning

confidence: 99%

Computing a Stable Distance on Merge Trees

Bollen,

Tennakoon,

Levine

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…All these descriptors are related to Morse theory [46] and level-set topology through relations among critical points. They are widely applied in scientific visualization [49,74,76].…”

Section: Related Workmentioning

confidence: 99%

A Structural Average of Labeled Merge Trees for Uncertainty Visualization

Yan

Wang

Munch

et al. 2020

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

“…In turbulent flows, a threshold that is defined based on the local tree structure around each maximum is used to extract multi-scale vortex structures [5]. In atmospheric science, leaves and sub-trees of the merge tree are used to extract locally thresholded superlevel-set components around maxima to track high-pressure regions [21]. The volume of superlevel-set components is used to compute a percolation threshold, which is useful in studying a flow's turbulence and validating normalization schemes [7,10].…”

Section: Introductionmentioning

confidence: 99%

Distributed merge forest

Huang

Klacansky

Petruzza

et al. 2021

Proceedings of the ACM International Conference on Supercomputing

Self Cite

View full text Add to dashboard Cite

Topological analysis is used in several domains to identify and characterize important features in scientific data, and is now one of the established classes of techniques of proven practical use in scientific computing. The growth in parallelism and problem size tackled by modern simulations poses a particular challenge for these approaches. Fundamentally, the global encoding of topological features necessitates interprocess communication that limits their scaling. In this paper, we extend a new topological paradigm to the case of distributed computing, where the construction of a global merge tree is replaced by a distributed data structure, the merge forest, trading slower individual queries on the structure for faster end-to-end performance and scaling. Empirically, the queries that are most negatively affected also tend to have limited practical use. Our experimental results demonstrate the scalability of both the merge forest construction and the parallel queries needed in scientific workflows, and contrast this scalability with the two established alternatives that construct variations of a global tree. CCS CONCEPTS• Theory of computation → Distributed algorithms; • Mathematics of computing → Exploratory data analysis.

show abstract

Exploring the evolution of pressure-perturbations to understand atmospheric phenomena

Cited by 11 publications

References 21 publications

Computing a Stable Distance on Merge Trees

Computing a Stable Distance on Merge Trees

A Structural Average of Labeled Merge Trees for Uncertainty Visualization

Distributed merge forest

Contact Info

Product

Resources

About