Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.jpdc.2017.04.008 | Journal of Parallel and Distributed Computing |
Keywords | Field | DocType |
Parallel algorithms,Mesh generation,Quality improvement,Domain decomposition,Dual graph | Polygon mesh,Parallel algorithm,Computer science,Parallel computing,Smoothing,Tetrahedron,Domain decomposition methods,Mesh generation,Speedup,Delaunay triangulation | Journal |
Volume | ISSN | Citations |
107 | 0743-7315 | 1 |
PageRank | References | Authors |
0.40 | 10 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| CHEN JianJun | 1 | 22 | 6.74 |
| Dawei Zhao | 2 | 193 | 20.38 |
| Yao Zheng | 3 | 276 | 29.32 |
| Yan Xu | 4 | 1 | 0.40 |
| Chen-Feng Li | 5 | 145 | 11.63 |
| Jianjing Zheng | 6 | 4 | 1.50 |