约束数据域三角剖分算法构建DTM的优化设计与实现

Designing on Optimized Algorithm of Delaunay Triangulation of Constrained Data Set for Constructing DTM

本文在分析现存算法特点的基础上，研究了影响约束数据域Delaunay三角剖分算法效率提高的因素，提出了优化算法，并进行了详细的程序流程设计。同时以优化算法在公路定线中的应用为例，证明了该算法能更好地处理带线约束、区域约束的构网问题，且具有构网速度快、网形优、精度高、算法稳定等特点。

This article studies the factors which influence the efficiency of Delaunay triangulation of constrained data set based on the analysis of the extant algorithm, and proposes an optimized algorithm, and then presents a procedure flow. Meanwhile based on a practical test, this algorithm which can custruct DTM quickly, effectively, precisely and stably is proved to resolve the problems of the zone lines restraint and the region restraint anstruction network.