基于多实体的矢量数据压缩改进算法

Improved algorithm for vector data compression based on multiple objects

矢量数据压缩在地形环境仿真、制图综合、GIS等研究中具有重要作用,对增加移动设备的存储能力和提高矢量数据的网络传输效率来说是一项很重要的工作。根据动态规划算法理论、Douglas-Peucker算法和矢量数据的特点,提出了基于动态规划算法的矢量数据压缩的模型和改进方法,通过一条参考路径构造一条带形成最小误差搜索范围,同时条带宽度可自适应调整。并将单一实体的优化压缩算法扩展为基于多实体的压缩算法,解决了图层压缩的全局优化问题。实验结果表明,该方法具有较高的效率,能够得到较小的压缩误差。

Vector data compression plays an important role in the research of terrain environment simulation,integrated mapping and GIS.It is a very important task for the increase of storage capacity of mobile equipment and the improvement of transmission efficiency of vector data on network.According to dynamic programming algorithm theory,Douglas-Peucker algorithm and vector data characteristics,the paper proposes a model and improved method of vector data compression based on dynamic programming algorithm,and extends this to the case of multiple objects.Experimental results show that this method can be smaller compression errors.