On Rectangular Cartograms

  • Marc van Kreveld
  • Bettina Speckmann
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3221)


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.


Planar Graph West Virginia Rectangular Partition Maximum Aspect Ratio Lower Average Error 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bazaraa, M., Sherali, H., Shetty, C.: Nonlinear Programming - Theory and Algorithms, 2nd edn. John Wiley & Sons, Hoboken (1993)zbMATHGoogle Scholar
  2. 2.
    Bosatlas, D.G.: Wolters-Noordhoff, Groningen, 52th edn (2001)Google Scholar
  3. 3.
    Dent, B.: Cartography - thematic map design, 5th edn. McGraw-Hill, New York (1999)Google Scholar
  4. 4.
    Dougenik, J.A., Chrisman, N.R., Niemeyer, D.R.: An algorithm to construct continuous area cartograms. Professional Geographer 37, 75–81 (1985)CrossRefGoogle Scholar
  5. 5.
    Edelsbrunner, H., Waupotitsch, E.: A combinatorial approach to cartograms. Comput. Geom. Theory Appl. 7, 343–360 (1997)zbMATHMathSciNetGoogle Scholar
  6. 6.
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Keim, D., North, S., Panse, C.: Cartodraw: A fast algorithm for generating contiguous cartograms. IEEE Trans. Visu. and Comp. Graphics 10, 95–110 (2004)CrossRefGoogle Scholar
  8. 8.
    Kocmoud, C., House, D.: A constraint-based approach to constructing continuous cartograms. In: Proc. Symp. Spatial Data Handling, pp. 236–246 (1998)Google Scholar
  9. 9.
    Koźmiński, K., Kinnen, E.: Rectangular dual of planar graphs. Networks 5, 145–157 (1985)Google Scholar
  10. 10.
  11. 11.
    Olson, J.: Noncontiguous area cartograms. Prof. Geographer 28, 371–380 (1976)CrossRefGoogle Scholar
  12. 12.
    Raisz, E.: The rectangular statistical cartogram. Geogr. Review 24, 292–296 (1934)CrossRefGoogle Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Tobler, W.: Thirty-five years of computer cartograms. Annals of the Assoc. American Cartographers 94(1), 58–71 (2004)Google Scholar
  15. 15.
    Tobler, W.: Pseudo-cartograms. The American Cartographer 13, 43–50 (1986)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Marc van Kreveld
    • 1
  • Bettina Speckmann
    • 2
  1. 1.Inst. for Information & Computing SciencesUtrecht University 
  2. 2.Dep. of Mathematics & Computer ScienceTU Eindhoven 

Personalised recommendations