2016
DOI: 10.1007/978-3-319-39441-1_6
|View full text |Cite
|
Sign up to set email alerts
|

Parallel Homology Computation of Meshes

Abstract: In this paper, we propose a method to compute, in parallel, the homology groups of closed meshes (i.e., orientable 2D manifolds without boundary) represented by combinatorial maps. Our experiments illustrate the interest of our approach which is really fast on big meshes and which obtains good speed-up when increasing the number of threads.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
3
0
3

Year Published

2018
2018
2020
2020

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(6 citation statements)
references
References 7 publications
(6 reference statements)
0
3
0
3
Order By: Relevance
“…The process consists of merging faces if they share a common edge, guaranteeing that the structure of the combinatorial map and the homology of the mesh is preserved throughout the process. This paper extends the work in Damiand and Gonzalez-Diaz (2016) and Damiand and Gonzalez-Diaz (2019) by giving an algorithm to approximate the lower-star persistent homology of meshes within a specified tolerance . First, faces are grouped into clusters according to the parameter .…”
Section: Introductionmentioning
confidence: 83%
See 2 more Smart Citations
“…The process consists of merging faces if they share a common edge, guaranteeing that the structure of the combinatorial map and the homology of the mesh is preserved throughout the process. This paper extends the work in Damiand and Gonzalez-Diaz (2016) and Damiand and Gonzalez-Diaz (2019) by giving an algorithm to approximate the lower-star persistent homology of meshes within a specified tolerance . First, faces are grouped into clusters according to the parameter .…”
Section: Introductionmentioning
confidence: 83%
“…In Damiand and Gonzalez-Diaz (2016), the authors proposed an efficient algorithm for computing the homology of meshes represented by 2D combinatorial maps, thereby avoiding the time-consuming step of constructing and modifying boundaries and coboundaries of cells. The process consists of merging faces if they share a common edge, guaranteeing that the structure of the combinatorial map and the homology of the mesh is preserved throughout the process.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…On choisit ici de présenter les cartes généralisées, telles que définies dans [25]. 4 (α i ) 0≤i≤n telle que :…”
Section: 23-c Cartes Combinatoiresunclassified
“…. Il est utilisé en modélisation géométrique [4] et dans d'autres domaines comme la médecine [5], la physique [6], l'analyse de données [7,8,9] ou encore en apprentissage automatique [10]. Intuitivement, l'homologie d'un objet représente ses "trous".…”
Section: Introductionunclassified