A genetic algorithm approach to cartographic map generalisation

Authors:
Ian D. Wilson;J. Mark Ware;J. Andrew Ware
Affiliations:
School of Technology, University of Glamorgan, Pontypridd CF37 1DL, UK;School of Computing, University of Glamorgan, Pontypridd CF37 1DL, UK;School of Computing, University of Glamorgan, Pontypridd CF37 1DL, UK
Venue:
Computers in Industry - Special issue: Soft computing in industrial applications
Year:
2003

Citing 5
Cited 3

A user's guide to tabu search

Annals of Operations Research - Special issue on Tabu search
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A Platform for Research in Generalization: Application to Caricature

Geoinformatica
Computational Perspectives on Map Generalization

Geoinformatica
Conflict Reduction in Map Generalization Using Iterative Improvement

Geoinformatica

Automated processing for map generalization using web services

Geoinformatica
Heuristic evaluation of usability of GeoWeb sites

W2GIS'07 Proceedings of the 7th international conference on Web and wireless geographical information systems
A GIS-based approach for urban multi-criteria quasi optimized route guidance by considering unspecified site satisfaction

GIScience'06 Proceedings of the 4th international conference on Geographic Information Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rendering map data at scales smaller than their source can give rise to map displays exhibiting graphic conflict, such that objects are either too small to be seen or too close to each other to be distinguishable. Furthermore, scale reduction will often require important features to be exaggerated in size, sometimes leading to overlapping features. Cartographic map generalisation is the process by which any graphic conflict that arises during scaling is resolved. In this paper, we show how a Genetic Algorithm (GA) approach was used to resolve spatial conflict between objects after scaling, achieving near optimal solutions within practical time constraints.