Distributed Augmentation, Hypersweeps, and Branch Decomposition of Contour Trees for Scientific Exploration
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914960500588544 |
|---|---|
| author | Li, Mingzhe Carr, Hamish Rübel, Oliver Wang, Bei Weber, Gunther H. |
| author_facet | Li, Mingzhe Carr, Hamish Rübel, Oliver Wang, Bei Weber, Gunther H. |
| contents | Contour trees describe the topology of level sets in scalar fields and are widely used in topological data analysis and visualization. A main challenge of utilizing contour trees for large-scale scientific data is their computation at scale using high-performance computing. To address this challenge, recent work has introduced distributed hierarchical contour trees for distributed computation and storage of contour trees. However, effective use of these distributed structures in analysis and visualization requires subsequent computation of geometric properties and branch decomposition to support contour extraction and exploration. In this work, we introduce distributed algorithms for augmentation, hypersweeps, and branch decomposition that enable parallel computation of geometric properties, and support the use of distributed contour trees as query structures for scientific exploration. We evaluate the parallel performance of these algorithms and apply them to identify and extract important contours for scientific visualization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_04836 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Distributed Augmentation, Hypersweeps, and Branch Decomposition of Contour Trees for Scientific Exploration Li, Mingzhe Carr, Hamish Rübel, Oliver Wang, Bei Weber, Gunther H. Computational Geometry Distributed, Parallel, and Cluster Computing Contour trees describe the topology of level sets in scalar fields and are widely used in topological data analysis and visualization. A main challenge of utilizing contour trees for large-scale scientific data is their computation at scale using high-performance computing. To address this challenge, recent work has introduced distributed hierarchical contour trees for distributed computation and storage of contour trees. However, effective use of these distributed structures in analysis and visualization requires subsequent computation of geometric properties and branch decomposition to support contour extraction and exploration. In this work, we introduce distributed algorithms for augmentation, hypersweeps, and branch decomposition that enable parallel computation of geometric properties, and support the use of distributed contour trees as query structures for scientific exploration. We evaluate the parallel performance of these algorithms and apply them to identify and extract important contours for scientific visualization. |
| title | Distributed Augmentation, Hypersweeps, and Branch Decomposition of Contour Trees for Scientific Exploration |
| topic | Computational Geometry Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2408.04836 |