反求工程中基于Delaunay三角形的模型重构研究

散乱点的三角网格剖分是反求工程中首要环节。在分析三角剖分基本方法的基础上提出了动态圆和封闭点的概念，使得搜索新三角形的范围大为降低，从而加快了速度，并在搜索过程中实现Delaunay三角形优化。通过动态更新搜索边控制三角形生成速度。将新三角形和已有三角形的相交判定转化为和搜索边的相交判定，完成非凸边界下的多连通区域的划分。

Delaunay Triangulation Algorithm Research in Reverse Engineering

Triangulation of scattered points is the first important section during the reverse engineering. New concepts of dynamic circle and occluded point were put forward based on deep consideration and analysis about the current basic method. This new concept can narrow the extent which triangulation process should seek through and optimize the triangles during producing. Dynamically updating the searching edges controls the progress of triangulation. The intersection judgement between the new triangle and produced triangles is changed into the intersection judgement between the new triangle and searching edges.