一种带岛屿约束数据域的三角网剖分算法研究

Study of Algorithm for Triangulation of Restrained Data Set with Islets

文中对多边形内部三角剖分算法及具有属性的带岛屿的约束数据域的D -三角剖分算法进行了研究 ,提出了一种适用于多边形内部的基于“最小内角优先原则”D -三角剖分算法及适用于多边形内、外部构网通用三角剖分算法 ,算法充分考虑到了构网数据域中存在多种不同属性块 ,并成功将算法应用于工程项目之中。

This paper researches the algorithm of the Delaunay Triangulation in polygon and the Delaunay Triangulation of data field with insets and attributes,a triangulation algorithm based on minimal internal angle priority applying to polygon inner is presented,as well as a general triangulation algorithm for inside and outside about polygon,In algorithm it is considered adequately that data field exits many different attribute blocks,and algorithm is applied successfully to project item.