# CartoDraw: a fast algorithm for generating contiguous cartograms

@article{Keim2004CartoDrawAF, title={CartoDraw: a fast algorithm for generating contiguous cartograms}, author={Daniel A. Keim and Stephen C. North and Christian Panse}, journal={IEEE Transactions on Visualization and Computer Graphics}, year={2004}, volume={10}, pages={95-110} }

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 map recognizable. We formally define a family of cartogram drawing problems. We show that even simple variants are unsolvable in the general case. Because the feasible variants are NP-complete, heuristics are needed to…

## 119 Citations

### Visualizing Geographic Information: VisualPoints vs CartoDraw

- Computer ScienceInf. Vis.
- 2003

This paper compares two algorithms that solve the continuous cartogram problem based on the Gridfit technique, which uses pixel-based distortion based on a quadtree-like data structure to make continuous cartograms that strictly retain the topology of the input mesh.

### Efficient cartogram generation: a comparison

- Computer ScienceIEEE Symposium on Information Visualization, 2002. INFOVIS 2002.
- 2002

This work compares two algorithms to solve the problem of making continuous cartograms that strictly retain the topology of the input mesh, which uses pixel-based distortion based on a quadtree-like data structure.

### Medial-Axes-based Cartograms

- Computer Science
- 2003

An algorithm is developed which uses an iterative relocation of the vertices based on a modified medial axes transformation of the polygon mesh to solve the continuous cartogram problem which strictly retains the topology of thepolygon mesh.

### Quantitative Measures for Cartogram Generation Techniques

- Computer Science
- 2014

A set of seven quantitative measures is defined, designed to evaluate how faithfully a cartogram represents the desired weights and to estimate the readability of the final representation.

### Cartograms with Topological Features

- Computer ScienceCGVC
- 2018

The goal is to include topological features such as a river in a Dorling-style or rectangular cartogram to make the visual layout more recognizable, increase map cognition and reduce geospatial error.

### A New Algorithm for Continuous Area Cartogram Construction with Triangulation of Regions and Restriction on Bearing Changes of Edges

- Computer Science
- 2006

This study proposes a construction algorithm that involves triangulation of regions and regularization through restrictions on the bearing changes of the edges in order to obtain visually clear results and application to the USA population datasets reveals that the algorithm has mathematical clarity and is user friendly.

### Optimal BSPs and rectilinear cartograms

- Computer ScienceGIS '06
- 2006

An algorithm for constructing rectilinear cartograms with zero cartographic error and correct region adjacencies is presented, and this algorithm works for a general class of optimality criteria, including size and depth.

### A New Construction Method for Circle Cartograms

- Mathematics
- 2011

An area cartogram is a transformed map on which areas of regions are proportional to statistical data values; it is considered to be a powerful tool for the visual representation of statistical data.…

### Rectangular Statistical Cartograms in R: The recmap Package

- Computer Science
- 2016

An R package implementing an algorithm called RecMap which approximates every map region by a rectangle where the area corresponds to the given statistical value (maintain zero cartographic error).

### Rectangular cartograms: construction & animation

- Computer ScienceSCG
- 2005

This work presents the first algorithms for rectangular cartogram construction, introduced by Raisz in 1934, where each region is represented by a rectangle, and has the advantage that the sizes of the regions can be estimated much better than with the first two types.

## References

SHOWING 1-10 OF 38 REFERENCES

### Continuous cartogram construction

- Computer ScienceProceedings Visualization '98 (Cat. No.98CB36276)
- 1998

A new algorithm for the construction of continuous area cartograms is presented that was developed by viewing their construction as a constrained optimization problem and uses a relaxation method that exploits hierarchical resolution, constrained dynamics, and a scheme that alternates goals of achieving correct region areas and adjusting region shapes.

### Cartography and Geographic Information Systems

- Computer Science
- 1990

GIS technology promises to transform cartography by changing what gets mapped, what form maps take, who makes and uses maps, and how maps are used.

### A Note on the Importance of Shape in Cartogram Communication

- Psychology
- 1972

Abstract Communicating with value-by-area cartograms is at best a difficult task. However, the mapmaker can render a cartogram more meaningful in communication by retaining the basic shapes of the…

### Area-normalized thematic views

- Mathematics
- 1998

Very expressive nonlinear transformations can be automatically generated to correct thematic maps so that the areas of map regions are proportional to the thematic variables assigned to them.

### A combinatorial approach to cartograms

- MathematicsSCG '95
- 1995

An algorithm is described that constructs homeomorphisms with prescribed area distortion that can be used to generate cartograms, which are geographic maps purposely distorted so its area distribution reflects a variable different from area.

### Cartographic transformations and the piezopleth maps method

- Physics
- 1989

AbstractNumerous types of anamorphoses, or cartographic transformations, have been perfected, leading to a distorted picture as compared to the usual map representations. Piezopleth maps are a…

### Human-guided simple search: combining information visualization and heuristic search

- Computer ScienceNPIVM '99
- 1999

The design and implementation of the initial prototype of the heuristic-search and information-visualization techniques in an interactive system for capacitated vehicle routing with time windows (CVRTW), some preliminary results, and the plans for future work are described.

### Exploring Large Graphs in 3D Hyperbolic Space

- Computer ScienceIEEE Computer Graphics and Applications
- 1998

A software system that explicitly attempts to handle much larger graphs than previous systems and support dynamic exploration rather than final presentation is described and the applicability of this system to goals beyond simple exploration is discussed.

### Tardis: a visual exploration environment for landscape dynamics

- Computer ScienceElectronic Imaging
- 1999

The creation of a visual environment for exploring landscape patterns and changes to such patterns over time is presented, entitled Tardis after the time machine of Dr. Who to emphasize the exploration of time dependent data.

### LEDA: a platform for combinatorial and geometric computing

- Computer ScienceCACM
- 1995

There is no standard library of the data structures and algorithms of combinatorial and geometric computing, and there are, for example, packages in statistics (SPSS), numerical analysis (LINPACK), symbolic computation (MAPLE, MATHEMATICA), and linear programming (CPLEX).