Abstract
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 (e.g., population). Good rectangular cartograms are hard to generate: The area specifications for each rectangle may make it impossible to realize correct adjacencies between the regions and so hamper the intuitive understanding of the map.
Here we present the first algorithms for rectangular cartogram construction. Our algorithms depend on a precise formalization of region adjacencies and are building upon existing VLSI layout algorithms. Furthermore, we characterize a non-trivial class of rectangular subdivisions for which exact cartograms can be efficiently computed. An implementation of our algorithms and various tests show that in practice, visually pleasing rectangular cartograms with small cartographic error can be effectively generated.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bazaraa, M., Sherali, H., Shetty, C.: Nonlinear Programming - Theory and Algorithms, 2nd edn. John Wiley & Sons, Hoboken (1993)
Bosatlas, D.G.: Wolters-Noordhoff, Groningen, 52th edn (2001)
Dent, B.: Cartography - thematic map design, 5th edn. McGraw-Hill, New York (1999)
Dougenik, J.A., Chrisman, N.R., Niemeyer, D.R.: An algorithm to construct continuous area cartograms. Professional Geographer 37, 75–81 (1985)
Edelsbrunner, H., Waupotitsch, E.: A combinatorial approach to cartograms. Comput. Geom. Theory Appl. 7, 343–360 (1997)
Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theor. Comp. Sci. 172, 175–193 (1997)
Keim, D., North, S., Panse, C.: Cartodraw: A fast algorithm for generating contiguous cartograms. IEEE Trans. Visu. and Comp. Graphics 10, 95–110 (2004)
Kocmoud, C., House, D.: A constraint-based approach to constructing continuous cartograms. In: Proc. Symp. Spatial Data Handling, pp. 236–246 (1998)
Koźmiński, K., Kinnen, E.: Rectangular dual of planar graphs. Networks 5, 145–157 (1985)
NCGIA / USGS. Cartogram Central (2002), http://www.ncgia.ucsb.edu/projects/Cartogram_Central/index.html
Olson, J.: Noncontiguous area cartograms. Prof. Geographer 28, 371–380 (1976)
Raisz, E.: The rectangular statistical cartogram. Geogr. Review 24, 292–296 (1934)
Sur-Kolay, S., Bhattacharya, B.: The cycle structure of channel graphs in nonslicable floorplans and a unified algorithm for feasible routing order. In: Proc. IEEE International Conference on Computer Design, pp. 524–527 (1991)
Tobler, W.: Thirty-five years of computer cartograms. Annals of the Assoc. American Cartographers 94(1), 58–71 (2004)
Tobler, W.: Pseudo-cartograms. The American Cartographer 13, 43–50 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Kreveld, M., Speckmann, B. (2004). On Rectangular Cartograms. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_64
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive