Computational geometry: an introduction
Computational geometry: an introduction
On-line construction of the convex hull of a simple polyline
Information Processing Letters
Progressive vector transmission
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
Approximation of Polygonal Curves with Minimum Number of Line Segments
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
Transmitting Vector Geospatial Data across the Internet
GIScience '02 Proceedings of the Second International Conference on Geographic Information Science
A hybrid aggregation and compression technique for road network databases
Knowledge and Information Systems
A perception based selection of vector map LoDs for progressive transmission
Proceedings of the 2nd ACM SIGSPATIAL International Workshop on GeoStreaming
| Hi-index | 0.00 |
Line simplification is the most commonly used operation in map generalisation. In many commercial Geographic Information Systems (GIS), line simplification is performed by applying the classical Ramer-Douglas-Peucker (RDP) algorithm. However, such an algorithm has the drawback of not guaranteeing the preservation of topological consistency. This requires a posteriori checks to ensure that unwanted intersections introduced by the application of the algorithm get rectified. To overcome this problem, Saalfeld proposed a modification of the classical RDP algorithm based on the fact that, while generalising a polyline, conflicts can only occur with vertices of other polylines that lie within its convex hull. In this paper we propose an improvement to Saalfeld's algorithm to detect possible self-intersections of a simplified polyline more efficiently. This improves the performance especially when generalising very large datasets. Nevertheless, the processing time is still not acceptable for real-time web mapping. Therefore, we have integrated our algorithm into a web mapping system that pre-computes a sequence of topologically consistent map representations, stores them on the server, and transmits them progressively upon request. We present experimental results of the performance of the algorithm as well as results of the transmission system.