Research on Generalization Technology of Spatial Line Vector Data

Abstract:

Data simplification is an important factor of the spatial data generalization, which is an effective way to improve rendering speed. This paper firstly introduces the algorithms classification of the spatial line vector data in two-dimensional environment, and then it emphatically summarizes and analyzes the advantages and disadvantages of the algorithms which can be used in the spatial line vector data simplification in the three dimensional environment. The three-dimensional Douglas-Peucker algorithm with a certain overall characteristics has wide application prospect. The simplified algorithms in 3D environment represent the development direction of the future. But at present, the existing data simplification algorithms in 3D environment are not mature enough, they all have certain advantages and disadvantages, this makes their use is limited by a certain extent. The application of these simplified algorithms in 2D and 3D is mostly on multi-resolution expression. Developing from 2D algorithm to the direction of 3D algorithm, it also lists many works and problems that need us to do and study in the future.

• Periodical: Applied Mechanics and Materials (Volumes 687-691)
• Pages: 1153-1156
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.687-691.1153
• Online since: November 2014
• Authors: Shi Qing Dou*, Xiao Yu Zhang
• Keywords: Multi-Resolution Expression, Spatial Line Vector Data Simplify, Three-Dimensional Douglas-Peucker Algorithm

References

[1] R. B. McMaster, The Integration of Simplification and Smoothing Algorithms in Line Generalization, Cartographica, 26(1989) 101-121.

DOI: 10.3138/c213-3627-90x7-lr15

[2] L. F. Fei, J. He, Three Dimensional Douglas-Peucker Algorithm and the Study of Its Application to Automated Generalization of DEM, J. Acta Geodaetica et Cartographica Sinica，8（2006）278-284.

DOI: 10.1117/12.712713

[3] H. H. Wu, On Automated Generalization of Relief Forms, Journal of the Wuhan Technical University of Surveying and Mapping, 20(Extra Issue, 1995) 1-6.

[4] D. H. Douglas, T. K. Peucker, Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its Caricature, The Canadian Cartographer, 10(1973), 112-122.

DOI: 10.3138/fm57-6770-u75u-7727

[5] J. He, L. F. Fei, Further Study on Three Dimensional Douglas-Peucker Algorithm and Its Application to Generalization of DEM , Geomatics and Information Science of Wuhan University, 2（2008）160-163.

DOI: 10.1117/12.712713

[6] L. N. Huang, L. F. Fei, Experimental Investigation on the Three Dimension Generalization of Contour Lines using 3D D-P Algorithm, Geomatics and Information Science of Wuhan University, 1（2010）55-58.

[7] Z. Wartell, E. Kang, T. Wasilewski, W. Ribarsky, N. Faust, Rendering Vector Data over Global, Multi-resolution 3D Terrain, Symposium on Data Visualization, 40( 2003) 213-222.

[8] G. Dutton, Digital Map Generalization Using a Hierarchical Coordinate System,  ACSM 57th Annual Convention, ASPRS 63rd Annual Convention, 4(1997) 367-376.

[9] J. Jiao, L. L. Wei, Q. M. Zeng, Algorithm for automated line simplification based on QTM, Science of Surveying and Mapping, 30(2005) 89-91.