面向有限元分析的三角网格布尔运算方法

为加速有限元分析流程，提出了一种面向有限元分析的自适应三角网格模型布尔运算方法。将ADT（alternating digital tree）数据结构应用于三角面片的判交计算，提升了布尔运算中三角面片的判交效率；借鉴结合球填充算法和插点/去点算法的网格重生成方法来重剖分局部区域，保证了算法的效率和生成网格的质量；通过改进的八叉树背景网格来记录和光滑尺寸场，生成了自适应的网格；通过尺寸场合理地控制重剖分区域，使算法效率和生成网格的质量得以很好地平衡。实验结果表明，所提方法可以高效地生成满足有限元分析需求的网格。

Triangular Mesh Boolean Operation Method for Finite Element Analysis

To shorten the cycle of finite element analysis (FEA), an adaptive triangular mesh Boolean operation method for finite element analysis is proposed. The ADT (alternating digital tree) data structure is applied to the intersection calculation of triangular meshes, which improves the efficiency of the intersection calculation of Boolean operations. A sphere packing algorithm and a node addition/deletion algorithm are used to remesh some remeshing regions, which ensures the efficiency of the method and the high-quality of remeshed meshes. An improved octree background grid is used to record and smooth the size field, which can generate size-adaptive meshes. The size field is used to reasonably control remeshing regions, which ensures the efficiency and mesh quality of the method. Results show that the proposed method can efficiently generate meshes that meet the needs of FEA.