凸包内空间散乱点集Delaunay四面体角度剖分算法  

Delaunay angle algorithm of spatial scattered point set Delaunay Triangulation for convex hull

作　　者：邵铁政[1] 李世森[1] 

机构地区：[1]天津大学,天津300072

出　　处：《水道港口》2013年第1期89-92,共4页Journal of Waterway and Harbor

摘　　要：提出空间散乱点集Delaunay四面体剖分的一种新算法,定义了一个新的Delaunay四面体判定标准即最大球缺角,并在Fortran平台上实现了这种算法,验证算法的准确性和高效性,对于解决空间De-launay四面体剖分来说是一个新的计算思路。将Delaunay四面体的判定改进为量化的判定,这样的判定方法相对以前的方法更容易、更快捷。A new algorithm of spatial scattered point set Delaunay Triangulation was put forward in this paper, and a new criteria for Delaunay Tetrahedron which was the maximum ball-lacking angle was defined. The new algorithm was carried out in the Fortran development environment to verify the correctness and effectiveness of the algorithm. It is a new calculated idea as for solving spatial Delaunay Triangulation. Improving the determination of Delaunay Tetrahedron to the quantitative determination is easier and faster than the previous methods.

关 键 词：散乱点 Delaunay规则 球缺角 空间三维四面体 

分 类 号：TP311.1[自动化与计算机技术—计算机软件与理论] P753[自动化与计算机技术—计算机科学与技术]