河北建筑工程学院学报2024,Vol.42Issue(1) :238-243.DOI:10.3969/j.issn.1008-4185.2024.01.038

基于动态规划的逐点后退法在路线压缩中的应用研究

A study on the application of the point-by-point backward method based on dynamic programming in route compression

李岩 王佳豪 王利民
河北建筑工程学院学报2024,Vol.42Issue(1) :238-243.DOI:10.3969/j.issn.1008-4185.2024.01.038

基于动态规划的逐点后退法在路线压缩中的应用研究

A study on the application of the point-by-point backward method based on dynamic programming in route compression

李岩 1王佳豪 1王利民1
扫码查看

作者信息

  • 1. 河北建筑工程学院,河北张家口 075000
  • 折叠

摘要

提出了一种路线数据压缩算法,该算法以"道格拉斯-普克(Douglas-Peucker,DP)压缩算法"为基础,并对其进行了一系列的改进.该算法对路线中的矢量坐标,以所设定的阈值为参考标准,从后向前递归的进行压缩,并提取出特征点.相对于DP算法,本算法具有更高的压缩效率,更小的压缩误差,在相对复杂曲线的压缩上,本算法在准确度方面具有更优异的表现.通过进一步结合动态规划方法,可使该算法平均误差在原算法的基础上再降低70%的误差,从而保证了压缩后曲线的准确度和完整性.

Abstract

A route data compression algorithm based on Douglas-Peucker(DP)compression algorithm is presented.The algorithm uses the set threshold as a reference standard to compress vector coordi-nates in the path from backward to forward recursively and extract feature points.Compared with the DP algorithm,this algorithm has higher compression efficiency,smaller compression errors,and better curve compression accuracy.By combining the dynamic programming method,the aver-age error can be reduced by 70%,and the optimal compression curve can be found,thus as to en-sure the accuracy and completeness of the compression curve.

关键词

曲线压缩/DP算法/动态规划算法/特征点

Key words

Curve compression/DP algorithm/Dynamic programming algorithm/Feature points

引用本文复制引用

出版年

2024
河北建筑工程学院学报
河北建筑工程学院

河北建筑工程学院学报

影响因子:0.502
ISSN:1008-4185
参考文献量11
段落导航相关论文