Delaunay三角剖分的最优化网格节点生成算法研究  

Research on optimal grid node generation algorithm for delaunay triangulation

作　　者：张晶飞 李射 崔向阳[1] ZHANG Jing-fei;LI She;CUI Xiang-yang(State Key Laboratory of Advanced Design and Manufacturing for Vehicle Body,Hunan University,Changsha 410082,China)

机构地区：[1]湖南大学汽车车身先进设计制造国家重点实验室,湖南长沙410082

出　　处：《电子设计工程》2019年第9期10-16,共7页Electronic Design Engineering

基　　金：国家自然科学基金项目(11872177)

摘　　要：针对任意域Delaunay三角剖分存在的局部网格质量不佳问题,提出了一种改进的Delaunay算法。利用边界三角形单元节点和重心的关系是否满足右手定则来判断初始三角形单元是否位于剖分域内的三角形重心法,并保留剖分域内的三角形单元;对待插入节点进行最优化处理以获得高质量网格,避免产生畸形单元;算例结果表明,所提方法可以适应复杂几何边界区域的划分,并可获得质量较高的三角形网格。In order to solve the problem of poor mesh quality in Delaunay triangulation of arbitrary domain,an improved Delaunay algorithm is proposed in this paper. By using whether the relation between the nodes and the center of gravity of the boundary triangle element satisfies the right rule to judge whether the triangular element is located in the subdivision of the triangle center of gravity,and the triangular element in the subdivision domain is retained. The insertion nodes are optimized to obtain high quality meshes and avoid abnormal units. Experiment results show that the method can adapt to the division of complex geometric boundary areas and obtain high quality triangular meshes.

关 键 词：DELAUNAY三角剖分 任意域 有限元网格 节点 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]