说明：  提出一种改进的Delaunay三角网渐次插入生成算法。在边界初始化阶段，无须对插入点进行排序，只须按链表顺序插入，在LOP算法中，因交换对角线而产生的新三角形只须遵循Delaunay三角化原则由里向外更新邻接三角形。实验结果表明，改进的算法能提高效率，加快Delaunay三角网的构建速度。
(A modified Delaunay triangulation algorithm gradually into generation. Initialization phase of the border, no need to sort the insertion point, simply insert the order by list in the LOP algorithm, generated by exchange of the diagonal triangle only to follow the new principle of Delaunay triangulation update adjacent triangles from the inside out . Experimental results show that the improved algorithm can improve the efficiency, speed up the construction speed of Delaunay triangulation.)