Compared with the remarkable progress made in parallel numerical solvers of partial differential equations,the development of algorithms for generating unstructured triangular/tetrahedral meshes has been relatively sluggish. In this paper, we propose a novel, consistent parallel advancing front technique (CPAFT) by combining the advancing front technique, the domain decomposition method based on space-filling curves, the distributed forest-of-overlapping-trees approach, and the consistent parallel maximal independent set algorithm. The newly proposed CPAFT algorithm can mathematically ensure that the generated unstructured triangular/tetrahedral meshes are independent of the number of processors and the implementation of domain decomposition. Several numerical tests are conducted to validate the parallel consistency and outstanding parallel efficiency of the proposed algorithm, which scales effectively up to two thousand processors. This is, as far as we know, the first parallel unstructured triangular/tetrahedral mesh generator with scalability to O(1,000) CPU processors.

翻译：与偏微分方程并行数值求解器取得的显著进展相比，非结构化三角形/四面体网格生成算法的发展相对迟缓。本文提出了一种新颖的一致性并行前沿推进技术（CPAFT），该技术结合了前沿推进技术、基于空间填充曲线的区域分解方法、分布式重叠树森林方法以及一致性并行极大独立集算法。新提出的CPAFT算法在数学上能够确保所生成的非结构化三角形/四面体网格与处理器数量及区域分解的具体实现方式无关。我们进行了若干数值测试，验证了该算法的并行一致性及其优异的并行效率，该算法可有效扩展至两千个处理器。据我们所知，这是首个可扩展至O(1,000)量级CPU处理器的并行非结构化三角形/四面体网格生成器。