基于动态规划算法的矢量数据压缩改进算法陈飞翔.pdfVIP

第 28卷第 1期 计算机应用 V ol. 28 No. 1 2008年 1月 ComputerApp lications Jan. 2008 : 1001- 9081( 2008) 01- 0168- 03 1 2 3 陈飞翔 , 周治武, 张建兵 ( 1. , 100083; 2., 100044; 3. () , 102249) ( fxc en@ 126. com) : 为了使移动设备存储大容量的矢量数据和提高矢量数据的网络传 效率, 矢量数据压缩是一项很重要 的工作提出了基于动态规划算法的矢量数据压缩的模型和改进方法, 通过 一条参考路径构造 一条带形成最小误差 搜索范围, 同时条带宽度可自适应调整实验结果表明, 该方法具有较高的效率, 能够得到较小的压缩误差 : 矢量数据压缩; 动态规划算法; Douglas-Peucker算法 : TP391. 4 1 : A Im proved algorithm for vector data com pression based on dynam ic programm ing 1 2 3 CHEN Fe-i xiang, ZHOU Z -iwu , ZHANG Jian-b ing ( 1. College of Inf ormation, Beij ing Forestry University, Beij ing 100083, China; 2.N ationalGeomatics Center of China, Beij ing 100044, China; 3. Dep artment of ComputerScience and echnology, China University of Petroleum, Beij ing 102249, China) A bstract: To increase t e storage capacity ofm obile equ ipm ent and mi prove t e transm iss ion efficiency of vector data on newt ork, t is paper proposed a m odel and mi proved m et od of vector data com pression based on dynam ic programm ing algorit m. T is m et od constructed a sm allest error range by a reference pat , t at can be adjusted au tom atically. T e expermi ental results s ow t at t ism et od is of ig er com pression ratio and sm aller com pression error. K ey w ords: vector data compression; dynam ic programm ing algorit m; Douglas-Peucker algorit m [ 1] 0 引言 ,