Permanent URL to this publication: http://dx.doi.org/10.5167/uzh-25588
Neun, M; Burghardt, D; Weibel, Robert (2009). Automated processing for map generalization with web services. GeoInformatica, 13(4):425-452.
View at publisher
- Registered users only
In map generalization various operators are applied to the features of a map in order to maintain and improve the legibility of the map after the scale has been changed. These operators must be applied in the proper sequence and the quality of the results must be continuously evaluated. Cartographic constraints can be used to define the conditions that have to be met in order to make a map legible and compliant to the user needs. The combinatorial optimization approaches shown in this paper use cartographic constraints to control and restrict the selection and application of a variety of different independent generalization operators into an optimal sequence. Different optimization techniques including hill climbing, simulated annealing and genetic deep search are presented and evaluated experimentally by the example of the generalization of buildings in blocks. All algorithms used in this paper have been implemented in a web services framework. This allows the use of distributed and parallel processing in order to speed up the search for optimized generalization operator sequences.
35 downloads since deposited on 15 Jan 2010
12 downloads since 12 months
|Item Type:||Journal Article, refereed, original work|
|Communities & Collections:||07 Faculty of Science > Institute of Geography|
|DDC:||910 Geography & travel|
|Deposited On:||15 Jan 2010 10:06|
|Last Modified:||14 Jul 2014 12:31|
|Additional Information:||The original publication is available at www.springerlink.com|
Users (please log in): suggest update or correction for this item
Repository Staff Only: item control page