三维凸域中候选卫星点集的确定算法

局部网格生成是无缝有限元并行计算的关键问题,然而,不恰当的局部网格生成算法会产生不一致网格.借助Delaunay三角剖分的唯一性,指出了三维凸域中Delaunay网格局部生成的不一致性,分析其产生的原因,建立避免局部网格不一致性的关键算法--搜索候选卫星点集的优化探索球算法,为网格并行生成做好数据准备.并从理论上证明了任意节点的优化探索球域包含其所有卫星点,从而,保证全域网格没有不一致性.通过算例分析了算法的正确性和局部性.

Construction of Candidate Satellite Notes Set in 3D Convex Domain

The node-based local mesh generation(NLMG) is a key issue of the seamless finite element parallel computing,however,an inappropriate local mesh generation algorithm will produce inconsistent mesh.With the uniqueness of Delaunay triangulation,this paper points out the probable inconsistencies during Delaunay mesh locally generated in three-dimensional convex domain and analysed their causes.The optimization exploring ball algorithm for searching a candidate satellite-node set is proposed as a key to avoid th...