约束Delaunay四面体剖分  

Constrained Delaunay tetrahedral subdivision

作　　者：张娟[1] 

机构地区：[1]巴音郭楞职业技术学院冶金与资源学院,新疆库尔勒841000

出　　处：《无线互联科技》2017年第12期111-112,共2页Wireless Internet Technology

摘　　要：文章研究了约束Delaunay四面体网格生成算法,引入了优化的网格算法,提高了四面体剖分单元的质量;重点研究了指定区域的边界边与边界面的一致性这两个Delaunay三角化算法迫切需要解决的关键性问题。结果表明,文章提出的约束Delaunay三角化算法适用性、效率及网格单元质量等方面都得到了提高,且该算法易于实现。This paper researches on the constrained Delaunay tetrahedral grid generation algorithm, introduces the optimized grid algorithm, and improves the quality of the tetrahedral subdivision unit. The key problem that the Delaunay triangulation algorithm is urgent to solve is to study the consistency problem of boundary boundary and boundary surface of the designated area. The results show that the proposed constrained Delaunay triangulation algorithm for applicability, efficiency and quality of grid cell are improved, and the algorithm is easy to implement.

关 键 词：约束DELAUNAY三角化 网格算法 四面体剖分 

分 类 号：TB115[理学—数学]