Map Polygon-Polygon Objects Spatial Conflicts Solution Using Simulated Annealing

Displaying map data at scales smaller than its source can result in objects that are either too small to be seen or too close to each other to be distinguishable. Furthermore, map conflicts become more likely when certain map symbols are no longer a true scale representation of the feature they represent. Map generalization involves careful examination of the interactions between all map symbols. These interactions may give rise to obvious spatial conflicts of proximity and overlap. Most cases of spatial conflicts can be resolved by displacement, whereas displacement is a very complex operation, which involves the type definitions, constraint conditions, direction and the size of the displacement and so on. As the simulated annealing method has its unique advantages in directing object displacement, in this paper, we guide the displacement of conflicted objects using simulated annealing. It is tested on a number of data sets and the result of experiment shows that the simulated annealing algorithm presented here works well.

[1]  Robert Laurini,et al.  A Methodology for Spatial Consistency Improvement of Geographic Databases , 2000, GeoInformatica.

[2]  C. Duchêne.  AUTOMATED MAP GENERALISATION USING COMMUNICATING AGENTS , 2003 .

[3]  Zhi-Hua Zhou,et al.  Three perspectives of data mining , 2003, Artif. Intell..

[4]  Geoffrey T. Parks,et al.  Simulated annealing: An alternative approach to true multiobjective optimization , 1999 .

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  Christopher B. Jones.  Conflict resolution in cartographic name placement , 1990, Comput. Aided Des..

[7]  Christopher B. Jones,et al.  Triangulated spatial models and neighbourhood search: an experimental comparison with quadtrees , 1999, The Visual Computer.

[8]  Christoph Schlieder,et al.  Reasoning About Ordering , 1995, COSIT.

[9]  Piotr Czyzżak,et al.  Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization , 1998 .

[10]  Franco P. Preparata,et al.  Computational Geometry , 1985, Texts and Monographs in Computer Science.

[11]  Christopher B. Jones,et al.  Conflict Reduction in Map Generalization Using Iterative Improvement , 1998, GeoInformatica.

[12]  Eliseo Clementini,et al.  Composite Regions in Topological Queries , 1995, Inf. Syst..

[13]  Max J. Egenhofer,et al.  Topological Error Correcting in GIS , 1997, SSD.

[14]  Steven Zoraster,et al.  Practical Results Using Simulated Annealing for Point Feature Label Placement , 1997 .

[15]  Keith A. Seffen,et al.  A SIMULATED ANNEALING ALGORITHM FOR MULTIOBJECTIVE OPTIMIZATION , 2000 .

[16]  Robert Weibel,et al.  A review and conceptual framework of automated map generalization , 1988, Int. J. Geogr. Inf. Sci..

[17]  Ai Tinghu.  A Constrained Delaunay Partitioning of Areal Objects to Support Map Generalization , 2000 .

[18]  Robert Weibel,et al.  Computational Perspectives on Map Generalization , 1998, GeoInformatica.