Paper Info
Title
MeshCleaner: A Generic and Straightforward Algorithm for Cleaning Finite Element Meshes.
Abstract
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.
Year
DOI
Venue
2018
10.1007/s10766-017-0507-0
International Journal of Parallel Programming
Keywords
Field
DocType
Finite Element mesh, Data structure, Mesh topology, Parallel algorithm
Data structure,Mesh networking,Polygon mesh,Computer science,Parallel algorithm,Parallel computing,Algorithm,Volume mesh,Finite element method,Theoretical computer science,T-vertices,Mesh generation
Journal
Volume
Issue
ISSN
46
3
0885-7458
Citations 
PageRank 
References 
1
0.38
20
Authors
5
Name
Order
Citations
PageRank
Gang Mei1236.98
Salvatore Cuomo221141.33
Hong Tian3173.04
Nengxiong Xu4226.00
Linjun Peng510.38