基于AFT-Delaunay的二维解耦并行网格生成算法

摘要

面向平面任意几何区域网格生成,提出了一种将波前法AFT(Advancing Front Technique)与Delaunay法相结合的解耦并行网格生成算法.算法主要思想是沿着求解几何区域惯性轴,采用扩展的AFT-Delaunay算法生成高质量三角形网格墙,递归地将几何区域动态划分成多个彼此解耦的子区域;采用OpenMP多线程并行技术,将子区域分配给多个CPU并行生成子区域网格;子区域内部的网格生成复用AFT-Delaunay算法,保证了生成网格的质量、效率和一致性要求.本算法优先生成几何边界与交界面网格,有利于提高有限元计算精度;各个子区域的网格生成彼此完全解耦,因此并行网格生成过程无需通信.该方法克服了并行交界面网格质量恶化难题,且具有良好的并行加速比,能够全自动、高效率地并行生成高质量的三角网格.%Based on Advancing Front Technique (AFT) combined with a Delaunay method,a new decoupling parallel mesh generation algorithm for two dimensional region is proposed.The main idea of the algorithm is along the inertia axis of geometry domain by using extended AFT-Delaunay algorithm,and the domain is divided dynamically into a plurality of mutually decoupled subdomains.The algorithm uses the OpenMP multi-thread method to allocate the subdomains to multiple CPUs,and subdomain meshes are generated in parallel.The mesh generation within subdomains reuses AFT-Delaunay algorithm,which ensures the quality,speed and consistency of mesh requirements.Since the interface wall mesh is generated firstly,the mesh generation of each subdomain is completely decoupled from each other,so the parallel mesh generation processes run without communication.The proposed method overcomes the mesh quality degradation problem of the parallel interface and has good parallel speedup,which is able to fully automatically generate high-quality triangular mesh with highly efficiency in parallel manner.