An Efficient Data Retrieval Parallel Reeb Graph Algorithm

The Reeb graph of a scalar function that is defined on a domain gives a topologically meaningful summary of that domain. Reeb graphs have been shown in the past decade to be of great importance in geometric processing, image processing, computer graphics, and computational topology. The demand for a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Algorithms Jg. 13; H. 10; S. 258
Hauptverfasser: Hajij, Mustafa, Rosen, Paul
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Basel MDPI AG 01.10.2020
Schlagworte:
Algorithms
Computer graphics
Data analysis
Data retrieval
Demand analysis
Domains
Image processing
Image segmentation
Information retrieval
Mathematical functions
parallel algorithms
Parallel processing
reeb graph
topological data analysis
Topology
Visualization
ISSN:1999-4893, 1999-4893
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The Reeb graph of a scalar function that is defined on a domain gives a topologically meaningful summary of that domain. Reeb graphs have been shown in the past decade to be of great importance in geometric processing, image processing, computer graphics, and computational topology. The demand for analyzing large data sets has increased in the last decade. Hence, the parallelization of topological computations needs to be more fully considered. We propose a parallel augmented Reeb graph algorithm on triangulated meshes with and without a boundary. That is, in addition to our parallel algorithm for computing a Reeb graph, we describe a method for extracting the original manifold data from the Reeb graph structure. We demonstrate the running time of our algorithm on standard datasets. As an application, we show how our algorithm can be utilized in mesh segmentation algorithms.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1999-4893
1999-4893
DOI:10.3390/a13100258