面向自然岸线抽稀的改进道格拉斯—普克算法  

An improved Douglas-Peucker algorithm oriented to natural shoreline simplification

作　　者：于靖[1] 陈刚[1] 张笑[1] 陈文龙[1] 

机构地区：[1]江苏省地理信息技术重点实验室/南京大学地理信息科学系,南京210023

出　　处：《测绘科学》2015年第4期23-27,33,共6页Science of Surveying and Mapping

基　　金：国家科技支撑计划项目子课题(2012BAH28B04-05)

摘　　要：针对已有的矢量数据压缩算法应用于方向线生成过程中会忽略国家海疆权益的问题,该文提出了一种面向自然岸线抽稀生成方向线的改进道格拉斯-普克算法。首先提取自然岸线凸点作为备选分段点集,进而根据凸点与相邻两点组成的三角形面积大小筛选分段点,接着利用相邻分段点作为道格拉斯-普克算法的首尾点,以基于最小二乘法的拟合曲线选定最优距离阈值,并作为初始阈值,进行逐段抽稀。实验结果表明,利用本算法抽稀所得面积比、压缩率均比传统道格拉斯-普克算法有所提升,且大部分情况下误差面积也有所减少。In view of the problem that maritime rights was neglected during direction-line generation using traditional vector data compression algorithm,an improved Douglas-Peucker algorithm was proposed in this paper.Firstly,the convex points of natural shoreline were extracted;then based on the triangle area composed by convex point and two adjacent points,segment points were filtered from convex points;finally,the data was divided into several parts,and the optimal distance threshold chose by curve-fit method on the basis of least square method as the initial threshold to perform the Douglas-Peucker algorithm in every part.Compared with traditional Douglas-Peucker algorithm,the area ratio and compression rate were improved,and the area error was also decreased in most cases.

关 键 词：自然岸线 方向线 凸点 抽稀 道格拉斯-普克算法 

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