Delaunay三角网内插特征点算法研究

Algorithm Study of the Delaunay Triangulation Net Interpolated feature points

在Delauany三角剖分网的基础上 ,对内插特征点算法进行了研究 ,提出了一种快速内插点算法。根据本算法的特点 ,提出了一种快速确定点所在的三角形的方法。

Based on the Delaunay Triangulation Net, the algorithm of the interpolated feature points isstudied. A fast interpolated feature point algorithm is proposed. At the same time, according to the feature of the algorithm, a method of fast seeking the triangle where a feature point is located in is put forward.