The Research on the Compression Algorithms for Vector Data
暂无分享,去创建一个
Vector data compression system carries important significance in studies such as geography environment simulation, map database establishment and GIS. But there are lots of redundant points in the digital topographic map. In order to reduce storage space and improve the speed, vector data must be compressed. The compression algorithms of the line element are researched in the paper. The line element is tracked by the digital software. The four algorithms are researched such as choosing interval points, limiting vertical distance, limiting angle, Douglas-Peucker. It is better that the number of nodes and the error are less in line elements by the compression algorithms. The result is that the Douglas - Peucker method is best, followed by the vertical distance method, the offset angle method and choosing interval points method.
[1] John Hershberger,et al. An O(nlogn) implementation of the Douglas-Peucker algorithm for line simplification , 1994, SCG '94.
[2] Li Qing. Research in WebGIS Vector Spatial Data Compression Methods , 2001 .
[3] Nabil H. Mustafa,et al. Near-Linear Time Approximation Algorithms for Curve Simplification , 2005, Algorithmica.