基于三角网的“种子法”多边形生成  

A Seed Extension Method of Polygon Construction Based on Delaunay Triangulation

作　　者：艾廷华[1] 陈涛[1] 

机构地区：[1]武汉大学资源与环境科学学院,武汉市珞喻路129号430079

出　　处：《武汉大学学报（信息科学版）》2004年第1期14-19,共6页Geomatics and Information Science of Wuhan University

基　　金：国家自然科学基金资助项目 (4 0 10 10 2 3 );测绘遥感信息工程国家重点实验室开放研究基金资助项目

摘　　要：将传统上广泛使用的“种子法”和“矢量求交法”的思想相结合 ,提出了一种基于约束Delaunay三角网结构的多边形生成算法。详细描述了该方法的基本思想 ,在实验基础上分析了算法的特点。Integrating the traditional seed extension method and the vector arc intersecting method, this paper presents a method for polygon creation based on the constrainted Delaunay triangulation. The triangle related to the label point acts as the first seed, and the continue extension of triangle in three directions finally accesses to the boundary. All the constraint edges connected in sequence forms the boundary of polygon. This method has the advantages that the polygon generation is local and that the arc terminal point matching and intersection point computation are performed simultaneously in the triangle extension.

关 键 词：三角网 多边形算法 拓扑关系 空间数据结构 

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