GIS岛多边形三角剖分算法  

GIS Island Polygon Triangulation Algorithm

作　　者：芦军军 田正华[2] 

机构地区：[1]渭南市城乡规划管理局高新分局,陕西渭南714000 [2]陕西铁路工程职业技术学院测绘系,陕西渭南714000

出　　处：《测绘与空间地理信息》2016年第11期168-170,174,共4页Geomatics & Spatial Information Technology

摘　　要：结合Delaunay三角剖分原理,在多边形顶点关系的基础上,通过对多边形从外向内间隔相邻级环间的三角剖分,来实现岛多边形的剖分算法。算法涉及图形相交、相邻、相离、包含等几何关系分析,以及Delaunay三角形构建等过程。对图形几何关系判断和三角形构建等过程进行了优化处理,提高了岛内三角剖分的精度和速度,解决了GIS制图中存在的"岛中岛"等复杂几何图形的剖分问题,可以对任意凹凸多边形实现快速三角剖分。首先获取并存储shape文件中多边形的空间坐标数据,然后基于该算法在VC++开发环境中完成岛多边形的三角剖分和显示。通过对不同形状的岛多边形反复测试表明,该算法的三角剖分结果均可达到最优,且效率较高。Combining with the principle of the Delaunay triangle subdivision, though interval adjacent level rings＇ s triangle subdivision from outside to inside, to realize the island polygon division algorithm, based on the relationship of polygon＇ s vertices. It involves graphics＇ intersect, union, separate, contain of geometry relationship＇ s analysis and Delaunay triangles building process. Though op- timized dealing with the graphics geometry relationship judgment and triangles building ways, improving triangle subdivision＇ s preci- sion and efficiency, to solve the island in island complex graphics＇ triangulation problem in GIS cartography, and also can realize quickly triangle subdivision in any concave and convex polygons. Firstly get and store polygon spatial coordinates data from Shape file, then complete the island polygon＇ s triangle subdivision and screen shown by using this algorithm in visual C ＋ ＋ development envi- ronment. Repeated tests of different shapes island polygon indicate that this algorithm can reach the optical results and high efficiency.

关 键 词：岛多边形 三角剖分 几何关系 

分 类 号：P208[天文地球—地图制图学与地理信息工程]