.png){kind=icon}
.png){kind=icon}
Return
Fine-grained parallel algorithm for unstructured surface mesh generation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compstruc.2015.04.004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A parallel surface meshing algorithm is proposed by exploiting the parallelism within the meshing process of a surface, which is more efficient than the conventional scheme that meshes surfaces individually. One integral part is the domain decomposition approach adopted, which ensures no small inter-domain angles; therefore, the parallel meshing procedure can fix the inter-domain boundary without compromising mesh quality. Combining the parallel surface mesher with the parallel tetrahedral mesher and improver developed previously, a parallel preprocessing pipeline for large-scale simulations is set up. It only consumes minutes to prepare a mesh containing hundreds of millions of elements. (C) 2015 Elsevier Ltd. All rights reserved.
Keywords:
Mesh generation
Parallel algorithm
Surface mesh
Domain decomposition
Graph partitioning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.