W-Structures in Contour Trees

Abstract

The contour tree is one of the principal tools in scientific visualisation. It captures the connectivity of level sets in scalar fields. In order to apply the contour tree to exascale data we need efficient shared memory and distributed algorithms. Recent work has revealed a parallel performance bottleneck caused by substructures of contour trees called W-structures. We report two novel algorithms that detect and extract the W-structures. We also use the W-structures to show that extended persistence is not equivalent to branch decomposition and leaf-pruning.

Metadata

Item Type:	Proceedings Paper
Authors/Creators:	Hristov, P Carr, HA https://orcid.org/0000-0001-6739-0283
Copyright, Publisher and Additional Information:	© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG. This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use (https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at https://doi.org/10.1007/978-3-030-83500-2_1.
Dates:	Published: 29 September 2021 Accepted: 12 August 2020
Institution:	The University of Leeds
Academic Units:	The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Depositing User:	Symplectic Publications
Date Deposited:	27 Oct 2020 14:06
Last Modified:	10 Aug 2023 13:00
Status:	Published
Publisher:	Springer
Series Name:	Mathematics and Visualization (MATHVISUAL)
Identification Number:	10.1007/978-3-030-83500-2_1
Open Archives Initiative ID (OAI ID):	oai:eprints.whiterose.ac.uk:167116

CORE (COnnecting REpositories)

W-Structures in Contour Trees

Abstract

Metadata

Download

Accepted Version

Export

Statistics