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

Delaunay angle algorithm of scattered point set delaunay triangulation for concave hull

作　　者：李世森[1] 王熹芳 

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

出　　处：《水道港口》2014年第2期180-184,共5页Journal of Waterway and Harbor

摘　　要：在邵铁政[1]三维空间散乱点集Delaunay四面体剖分算法的基础上,提出了一种不含有除法运算(不存在被0除或丧失计算精度的情形)的通用的判定空间两三角形内交的算法,可以实现凹包内散乱点集的Delaunay四面体剖分。该算法已经通过Fortran语言编程实现并且给出了算例。Based on Delaunay Angle Algorithm of Spatial Scattered Point Set Delaunay Triangulation for Con- vex Hull defined by SHAO Tie-zheng, a new common algorithm of judging two triangles intersection which did not contain the division （without the case of divided by zero or loss of accuracy） was proposed in this paper, and the algo- rithm could solve spatial scattered point set Delaunay triangulation for concave hull. The actual programming opera- tion of the new algorithm was also carried out by Fortran, and an example was given.

关 键 词：散乱点 Delaunay规则 空间三角形内交 四面体 

分 类 号：O182.2[理学—数学]