Comparison of vector data compression algorithms in Mobile GIS
- 1 July 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 613-617
Abstract
Spatial data compression is particularly important for the development of Mobile GIS. This paper gives a review on vector data compression of Mobile GIS. Firstly, the definition and classification of vector data compression algorithms are introduced. Secondly, the traditional, new and optimal algorithms are analyzed separately, and their principles, research status, strengths and weaknesses are further discussed in detail. In the end, this paper makes an important comparison among Douglas-Peucker algorithm, wavelet-based algorithm and dynamic programming-based algorithm.Keywords
This publication has 7 references indexed in Scilit:
- Improved algorithm for vector data compression based on dynamic programmingJournal of Computer Applications, 2008
- Data reduction of large vector graphicsPattern Recognition, 2005
- Reduced-search dynamic programming for approximation of polygonal curvesPattern Recognition Letters, 2003
- Ant colony search algorithms for optimal polygonal approximation of plane curvesPattern Recognition, 2003
- A new method for polygonal approximation using genetic algorithmsPattern Recognition Letters, 1998
- Polygonal approximation using a competitive Hopfield neural networkPattern Recognition, 1994
- Optimum polygonal approximation of digitized curvesPattern Recognition Letters, 1994