A rectangular cartogram is a type of map where every region is a rectangle. The size of the rectangles is chosen such that their areas represent a geographic variable such as population or GDP. In recent years several algorithms for the automated construction of rectangular cartograms have been proposed, some of which are based on rectangular duals of the dual graph of the input map. In this paper we present a new approach to efficiently search within the exponentially large space of all possible rectangular duals. We employ evolution strategies that find rectangular duals which can be used for rectangular cartograms with correct adjacencies and (close to) zero cartographic error. This is a considerable improvement upon previous methods that have to either relax adjacency requirements or deal with larger errors. We present extensive experimental results for a large variety of data sets.
Keywords: Rectangular cartogram – evolution strategy – regular edge labeling
|Naam||Lecture Notes in Computer Science|
|ISSN van geprinte versie||0302-9743|
|Congres||conference; 7th International Conference on Geographic Information Science; 2012-09-18; 2012-09-21|
|Periode||18/09/12 → 21/09/12|
|Ander||7th International Conference on Geographic Information Science|