The authors performed this research while employed at the Harvard University-Laboratory for Computer Graphics and Spatial Analysis. The algorithm was written by Dougenik in summer of 1981 and results were displayed as poster at Harvard Computer Graphics Week 1981. A draft of this paper was presented at Harvard Graphics Week 1982. Phillip Muehrcke provided comments on a draft. The comments of the reviewers, Poh-Chin Lai and D. R. F. Taylor, are also gratefully acknowledged. Funds from the University of Wisconsin-Madison Graduate School assisted in preparing the manuscript.
AN ALGORITHM TO CONSTRUCT CONTINUOUS AREA CARTOGRAMS†
Article first published online: 23 FEB 2005
DOI: 10.1111/j.0033-0124.1985.00075.x
Additional Information
How to Cite
Dougenik, J. A., Chrisman, N. R. and Niemeyer, D. R. (1985), AN ALGORITHM TO CONSTRUCT CONTINUOUS AREA CARTOGRAMS. The Professional Geographer, 37: 75–81. doi: 10.1111/j.0033-0124.1985.00075.x
- †
Publication History
- Issue published online: 23 FEB 2005
- Article first published online: 23 FEB 2005
- Abstract
- References
- Cited By
Keywords:
- cartograms;
- thematic cartography;
- computer cartography;
- transformations;
- distortion of maps
Continuous area cartograms distort planimetric maps to produce a desired set of areas while preserving the topology of the original map. We present a computer algorithm which achieves the result iteratively with high accuracy. The approach uses a model of forces exerted from each polygon centroid, acting on coordinates in inverse proportion to distance. This algorithm can handle more realistic descriptions of polygon boundaries than previous algorithms and manual methods, thus enhancing visual recognition.

1467-9272/asset/prog_left.gif?v=1&s=4b9129c68a1ea1e28e2e5132ce595152861f2eb4)
1467-9272/asset/prog_right.gif?v=1&s=d2acd14cd488990cfb74b76eab57fd2d6026322f)
