Journal article 839 views 176 downloads
Domain decomposition approach for parallel improvement of tetrahedral meshes
Journal of Parallel and Distributed Computing, Volume: 107, Pages: 101 - 113
Swansea University Author: Chenfeng Li
PDF | Accepted ManuscriptDownload (1.22MB)
DOI (Published version): 10.1016/j.jpdc.2017.04.008
Presently, a tetrahedral mesher based on the Delaunay triangulation approach may outperform a tetrahedral improver based on local smoothing and flip operations by nearly one order in terms of computing time. Parallelization is a feasible way to speed up the improver and enable it to handle large-sca...
|Published in:||Journal of Parallel and Distributed Computing|
Check full text
No Tags, Be the first to tag this record!
Presently, a tetrahedral mesher based on the Delaunay triangulation approach may outperform a tetrahedral improver based on local smoothing and flip operations by nearly one order in terms of computing time. Parallelization is a feasible way to speed up the improver and enable it to handle large-scale meshes. In this study, a novel domain decomposition approach is proposed for parallel mesh improvement. It analyses the dual graph of the input mesh to build an inter-domain boundary that avoids small dihedral angles and poorly shaped faces. Consequently, the parallel improver can fit this boundary without compromising the mesh quality. Meanwhile, the new method does not involve any inter-processor communications and therefore runs very efficiently. A parallel pre-processing pipeline that combines the proposed improver and existing parallel surface and volume meshers can prepare a quality mesh containing hundreds of millions of elements in minutes. Experiments are presented to show that the developed system is robust and applicable to models of a complication level experienced in industry.
Parallel algorithms; Mesh generation; Quality improvement; Domain decomposition; Dual graph
Faculty of Science and Engineering