Efficient and consistent line simplification for web mapping
by Michela Bertolotto, Min Zhou
International Journal of Web Engineering and Technology (IJWET), Vol. 3, No. 2, 2007

Abstract: Commercial Geographical Information Systems (GISs) incorporate line simplification functionality to generate generalised versions of maps. A commonly used algorithm is the classical Ramer-Douglas-Peucker (RDP) algorithm. Such an algorithm does not guarantee the preservation of topological consistency and therefore requires a posteriori checks to rectify unwanted intersections. To overcome this problem, Saalfeld proposed a modification based on the fact that, while generalising a polyline, conflicts can only occur with vertices of other polylines that lie within its convex hull. We have developed an improved version of Saalfeld's algorithm to detect possible self-intersections more efficiently. Although this improves the performance, especially when generalising very large data sets, the processing time is still not acceptable for real-time web mapping. Therefore, we have integrated our algorithm into a web-mapping system that relies on progressive transmission. In this paper we describe our improved algorithm and the experimental results. We also discuss the progressive transmission approach.

Online publication date: Mon, 15-Jan-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web Engineering and Technology (IJWET):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com