A study on the application of the point-by-point backward method based on dynamic programming in route compression
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.