基于径向约束与点位优化的Douglas-Peucker改良算法
|
摘要
目前众多的矢量数据压缩算法存在提高压缩曲线精度的同时牺牲压缩效率的问题。为此,文章提出一种以带有径向约束的Douglas-Peucker算法为基础来调整曲线局部形态特征点位置的矢量数据压缩算法。首先,通过带有径向约束的Douglas-Peucker算法提取曲线的特征点;其次,筛选出各个局部曲线段的重要形态特征点;最终,通过重要形态特征点对曲线进行局部调整,以提高曲线整体精度。实验表明,该方法一方面保证了压缩效率不变,另一方面能够有效降低局部位移偏差和面积偏差,从而提高曲线的压缩精度。
At present,most of vector data compression algorithm have the problem that when improving the compression precision they will reduce the compression efficiency.In order to solve the problem,the algorithm of vector data compression based on radial constraints and point optimization was proposed in this paper.Firstly,we extract the feature points of the curve by means of Douglas-Peucker algorithm with radial constraints; Secondly,we extract the important feature points of each local curve; Finally,we need to make some minor adjustments in each local curve with the help of the important feature points extracted in advance to improve the overall accuracy of the curve.Experimental results show that the algorithm can reduce the displacement deviation and the area deviation when ensuring the compression efficiency,and better retain the original curve shape characteristic.
At present,most of vector data compression algorithm have the problem that when improving the compression precision they will reduce the compression efficiency.In order to solve the problem,the algorithm of vector data compression based on radial constraints and point optimization was proposed in this paper.Firstly,we extract the feature points of the curve by means of Douglas-Peucker algorithm with radial constraints; Secondly,we extract the important feature points of each local curve; Finally,we need to make some minor adjustments in each local curve with the help of the important feature points extracted in advance to improve the overall accuracy of the curve.Experimental results show that the algorithm can reduce the displacement deviation and the area deviation when ensuring the compression efficiency,and better retain the original curve shape characteristic.
引文
[1]闫浩文,王明孝,王中辉.计算几何:空间数据处理算法[M].北京:科学出版中心资源环境分社,2012.
[2]李德仁,袁修孝.误差处理与可靠性理论[M].2版.武汉:武汉大学出版社,2012.
[3]郭仁忠.空间分析[M].武汉:武汉测绘科技大学出版社,1997.
[4]DOUGLAS D H,PEUCKER T K.Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its Caricature[J].The Canadian Cartographer,1973,10(2):112-122.
[5]黄培之.具有预测功能的曲线矢量数据压缩方法[J].测绘学报,1995,24(4):316-320.
[6]杨得志,王杰臣,闾国年.矢量数据压缩的Douglas-Peucker算法的实现与改进[J].测绘通报,2002(7):18-22.
[7]王杰臣,间国年.曲线数量数据综合的微凹凸消除算法[J].测绘通报,2002(1):17-18.
[8]巨正平,王勇,郭广礼,齐建伟.附有限制条件的逐点压缩算法的设计与实现[J].测绘通报,2009(4):25-04.
[9]刘鹏程,罗静,艾廷华,李畅.基于线要素综合的形状相似性评价模型[J].武汉大学学报:信息科学版,2012,37(1):114-117.
[10]武芳,鲲鹏.线要素化简算法几何精度评估[J].武汉大学学报:信息科学版,2012,33(6):600-603.
[11]杨敏,艾廷华,卢威,成晓强,周启.自发地理信息兴趣点数据在线综合与多尺度可视化方法[J].测绘学报,2015,44(2):228-234.
[2]李德仁,袁修孝.误差处理与可靠性理论[M].2版.武汉:武汉大学出版社,2012.
[3]郭仁忠.空间分析[M].武汉:武汉测绘科技大学出版社,1997.
[4]DOUGLAS D H,PEUCKER T K.Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its Caricature[J].The Canadian Cartographer,1973,10(2):112-122.
[5]黄培之.具有预测功能的曲线矢量数据压缩方法[J].测绘学报,1995,24(4):316-320.
[6]杨得志,王杰臣,闾国年.矢量数据压缩的Douglas-Peucker算法的实现与改进[J].测绘通报,2002(7):18-22.
[7]王杰臣,间国年.曲线数量数据综合的微凹凸消除算法[J].测绘通报,2002(1):17-18.
[8]巨正平,王勇,郭广礼,齐建伟.附有限制条件的逐点压缩算法的设计与实现[J].测绘通报,2009(4):25-04.
[9]刘鹏程,罗静,艾廷华,李畅.基于线要素综合的形状相似性评价模型[J].武汉大学学报:信息科学版,2012,37(1):114-117.
[10]武芳,鲲鹏.线要素化简算法几何精度评估[J].武汉大学学报:信息科学版,2012,33(6):600-603.
[11]杨敏,艾廷华,卢威,成晓强,周启.自发地理信息兴趣点数据在线综合与多尺度可视化方法[J].测绘学报,2015,44(2):228-234.