A Linear Programming Approach to Rectangular Cartograms

In [26], the first two authors of this paper presented the first algorithms to construct rectangular cartograms. The first step is to determine a representation of all regions by rectangles and the second — most important — step is to get the areas of all rectangles correct. This paper presents a new approach to the second step. It is based on alternatingly solving linear programs on the x-coordinates and the y-coordinates of the sides of the rectangles. Our algorithm gives cartograms with considerably lower error and better visual qualities than previous approaches. It also handles countries that cannot be present in any purely rectangular cartogram and it introduces a new way of controlling incorrect adjacencies of countries. Our implementation computes aesthetically pleasing rectangular and nearly rectangular cartograms, for instance depicting the 152 countries of the World that have population over one million.

[1]  Rectangular cartogram computation with sea regions , 2005 .

[2]  Sartaj Sahni,et al.  A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph , 1987, Networks.

[3]  Herbert Edelsbrunner,et al.  A combinatorial approach to cartograms , 1995, SCG '95.

[4]  Jeffrey S. Torguson,et al.  Cartography , 2019, Dictionary of Geotourism.

[5]  James A. Dougenik,et al.  AN ALGORITHM TO CONSTRUCT CONTINUOUS AREA CARTOGRAMS , 1985 .

[6]  E. Raisz.  The Rectangular Statistical Cartogram , 1934 .

[7]  M. Newman,et al.  From The Cover: Diffusion-based method for producing density-equalizing maps. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Bettina Speckmann,et al.  On Rectilinear Duals for Vertex-Weighted Plane Graphs , 2005, Graph Drawing.

[9]  Daniel A. Keim,et al.  RecMap: Rectangular Map Approximations , 2004, IEEE Symposium on Information Visualization.

[10]  Katta G. Murty,et al.  Nonlinear Programming Theory and Algorithms , 2007, Technometrics.

[11]  Edwin Kinnen,et al.  Rectangular duals of planar graphs , 1985, Networks.

[12]  C. Brienen.  De Grote Bosatlas , 2004 .

[13]  Bettina Speckmann,et al.  On rectangular cartograms , 2004, Comput. Geom..

[14]  Donald H. House,et al.  A Constraint-Based Approach to Constructing Continuous Cartograms , 1998 .

[15]  Goos Kant,et al.  Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems , 1997, Theor. Comput. Sci..

[16]  Waldo R. Tobler.  Thirty Five Years of Computer Cartograms , 2004 .

[17]  Judy M. Olson,et al.  NONCONTIGUOUS AREA CARTOGRAMS , 1976 .

[18]  Therese C. Biedl,et al.  Complexity of Octagonal and Rectangular Cartograms , 2005, CCCG.

[19]  Hsueh-I Lu,et al.  Compact floor-planning via orderly spanning trees , 2003, J. Algorithms.

[20]  Daniel A. Keim,et al.  CartoDraw: a fast algorithm for generating contiguous cartograms , 2004, IEEE Transactions on Visualization and Computer Graphics.