一种三维离散点数据生成非结构四面体算法  

An Algorithm of Generating Unstructured Tetrahedrons from 3D Discrete Points

作　　者：孔娟华[1] 郑江滨[1] 

机构地区：[1]西北工业大学计算机学院,陕西西安710072

出　　处：《计算机工程与科学》2009年第1期35-37,共3页Computer Engineering & Science

基　　金：国家863计划资助项目(2006AA01Z324);西北工业大学研究生创业种子基金资助项目(Z200752)

摘　　要：3D离散点数据的Delaunay三角剖分是构造曲面网格的关键技术之一。针对常用的基于三角网递推原理的Delaunay四面体局部构造生成算法中往往存在的四面体不相容问题,本文提出在当前点的局部计算中构造新四面体时,除了参考当前局部计算之前已生成的四面体集约束关系外,同时考虑当前点局部计算过程中生成的四面体集约束关系的非结构四面体生成算法,从而改善了新生成四面体与已有四面体的不相容性。文中最后给出的实验结果验证了本文算法的有效性。Delaunay tetrahedron generation is one of the important techniques to construct surface mesh using three dimensional discrete points. Because it is a common case of the inconsistent tetrahedrons in the algorithm of locally constructing the Delaunay tetrahedron based on the principle of triangular meshes eduction, this paper presents a novel Delaunay tetrahedralization scheme to solve this problem. During the procedure of constructing the Delatmay tetrahedron, not only the tetrahedrons totally constructed before the local computing of the current points are utilized, but also the tetrahedrons constructed during the local computing of the current points are considered as the boundary information. Therefore the consistent compatibility of making tetrahedrons is improved. At the end of this paper, several experiments are given to show that the proposed algorithm is efficient

关 键 词：DELAUNAY四面体 四面体不相容 三角网 

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