Yuwei Wang
ABSTRACT
Map generalization is commonly used in many GIS applications to produce maps with less detail so as to reduce the mapping complexity. Different from common simplifying strategies which simplify individual geometry objects separately, in this paper we consider the problem of generalizing the geometry objects under the topological constraints among the geometries and given constraining points. We propose a Cross-line algorithm to simplify the map while preserving the topological constraints. The proposed algorithm is extensively evaluated on five real map datasets and large synthetic datasets, and the results show that our proposed approach can greatly simplify the map with extremely high correctness and excellent efficiency.
- ACM sigspatial cup 2014. Available from http://mypages.iit.edu/~xzhang22/GISCUP2014/. Accessed April 1, 2014.Google Scholar
- B. Chapman, G. Jost, and R. Van Der Pas. Using OpenMP: portable shared memory parallel programming, volume 10. MIT press, 2008. Google ScholarDigital Library
- D. H. Douglas and T. K. Peucker. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Cartographica: The International Journal for Geographic Information and Geovisualization, 10(2):112--122, 1973.Google ScholarCross Ref
- H. Jeung, M. L. Yiu, X. Zhou, C. S. Jensen, and H. T. Shen. Discovery of convoys in trajectory databases. Proceedings of the VLDB Endowment, 1(1):1068--1080, 2008. Google ScholarDigital Library
- W. A. Mackaness, A. Ruas, and L. T. Sarjakoski. Generalisation of geographic information: cartographic modelling and applications. Elsevier, 2011.Google Scholar
- M. Visvalingam and J. Whyatt. Line generalisation by repeated elimination of points. The Cartographic Journal, 30(1):46--51, 1993.Google ScholarCross Ref
Index Terms
- A fast algorithm of geometry generalization
Recommendations
Mesh optimization using global error with application to geometry simplification
Special issue: Processing on large polygonal meshesThis paper presents a linear running time optimization algorithm for meshes with subdivision connectivity, e.g., subdivision surfaces. The algorithm optimizes a model using a metric defined by the user. Two functionals are used to build the metric: a ...
Occluder Simplification Using Planar Sections
We present a method for extreme occluder simplification. We take a triangle soup as input, and produce a small set of polygons with closely matching occlusion properties. In contrast to methods that optimize the original geometry, our algorithm has very ...
Combining Geometry Simplification and Coordinate Approximation Techniques for Better Lossy Compression of GIS Data
DCC '13: Proceedings of the 2013 Data Compression ConferenceThe high bandwidth requirements of GIS data is usually one of the main bottlenecks in the development of client-server GIS applications. Nowadays, spatial information is generated with high resolution and thus it has high storage costs. Depending on the ...
Comments