Efficient Cartogram Generation: A Comparison

Authors:
Daniel A. Keim;Stephen C. North;Christian Panse;Jörn Schneidewind
Affiliations:
-;-;-;-
Venue:
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Year:
2002

Citing 4
Cited 5

A combinatorial approach to cartograms

Computational Geometry: Theory and Applications
The Gridfit algorithm: an efficient and effective approach to visualizing large amounts of spatial data

Proceedings of the conference on Visualization '98
Continuous cartogram construction

Proceedings of the conference on Visualization '98
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing

Visualizing geographic information: VisualPoints vs CartoDraw

Information Visualization
Medial-Axis-Based Cartograms

IEEE Computer Graphics and Applications
A Visualization System for Space-Time and Multivariate Patterns (VIS-STAMP)

IEEE Transactions on Visualization and Computer Graphics
Carto-SOM: cartogram creation using self-organizing maps

International Journal of Geographical Information Science
Generalized scatter plots

Information Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cartograms are a well-known technique for showing geography-related statistical information, such as population demographics and epidemiological data. The basic idea is to distort a map by resizing its regions according to a statistical parameter, but in a way that keeps the maprecognizable. In this paper, we deal with the problem of making continuous cartograms that strictly retain the topology of the input mesh. We compare two algorithms to solve the continuous cartogram problem. The first one uses an iterative relocation of the vertices based on scanlines. The second one is based on the Gridfit technique, which uses pixel-based distortion based on a quadtree-like data structure.