Parallel generation of meshes with cracks using binary spatial decomposition

Freitas, Markos O.; Wawrzynek, Paul A.; Cavalcante-Neto, Joaquim Bento; Vidal, Creto Augusto; Carter, Bruce J.; Martha, Luiz Fernando; Ingraffea, Anthony R.

doi:10.1007/s00366-016-0444-3

Cited by 5 publications

(1 citation statement)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many works exist on parallel mesh processing and adaptive hexahedral mesh refinement (see for example [31][32][33][34][35][36][37][38][39][40][41][42]) which shows the interest of this field of research. Several libraries are available that provide efficient parallel adaptive mesh refinement, for example libMesh [43] or PUMI [44].…”

Section: A Parallel Algorithm Of Mesh Processing Based On 3-dmapsmentioning

confidence: 99%

Distributed Combinatorial Maps for Parallel Mesh Processing

et al. 2018

View full text Add to dashboard Cite

Abstract:We propose a new strategy for the parallelization of mesh processing algorithms. Our main contribution is the definition of distributed combinatorial maps (called n-dmaps), which allow us to represent the topology of big meshes by splitting them into independent parts. Our mathematical definition ensures the global consistency of the meshes at their interfaces. Thus, an n-dmap can be used to represent a mesh, to traverse it, or to modify it by using different mesh processing algorithms. Moreover, an nD mesh with a huge number of elements can be considered, which is not possible with a sequential approach and a regular data structure. We illustrate the interest of our solution by presenting a parallel adaptive subdivision method of a 3D hexahedral mesh, implemented in a distributed version. We report space and time performance results that show the interest of our approach for parallel processing of huge meshes.

show abstract

Section: A Parallel Algorithm Of Mesh Processing Based On 3-dmapsmentioning

confidence: 99%

Distributed Combinatorial Maps for Parallel Mesh Processing

et al. 2018

View full text Add to dashboard Cite

show abstract

MeshCleaner: A Generic and Straightforward Algorithm for Cleaning Finite Element Meshes

Mei

Cuomo

Tian

et al. 2017

Int J Parallel Prog

View full text Add to dashboard Cite

Mesh cleaning is the procedure of removing duplicate nodes, sequencing the indices of remaining nodes, and then updating the mesh connectivity for a topologically invalid Finite Element mesh. To the best of our knowledge, there has been no previously reported work specifically focused on the cleaning of large Finite Element meshes. In this paper we specifically present a generic and straightforward algorithm, MeshCleaner, for cleaning large Finite Element meshes. The presented mesh cleaning algorithm is composed of (1) the stage of compacting and reordering nodes and (2) the stage of updating mesh topology. The basic ideas for performing the above two stages efficiently both in sequential and in parallel are introduced. Furthermore, one serial and two parallel implementations of the algorithm MeshCleaner are developed on multi-core CPU and/or many-core GPU. To evaluate the performance of our algorithm, three groups of experimental tests are conducted. Experimental results indicate that the algorithm MeshCleaner is capable of cleaning large meshes very efficiently, both in sequential and in parallel. The presented mesh cleaning algorithm MeshCleaner is generic, simple, and practical

show abstract