Computing Stable Demers Cartograms

Cartograms are popular for visualizing numerical data for map regions. Maintaining correct adjacencies is a primary quality criterion for cartograms. When there are multiple data values per region (over time or different datasets) shown as animated or juxtaposed cartograms, preserving the viewer's mental-map in terms of stability between cartograms is another important criterion. We present a method to compute stable Demers cartograms, where each region is shown as a square and similar data yield similar cartograms. We enforce orthogonal separation constraints with linear programming, and measure quality in terms of keeping adjacent regions close (cartogram quality) and using similar positions for a region between the different data values (stability). Our method guarantees ability to connect most lost adjacencies with minimal leaders. Experiments show our method yields good quality and stability.

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

[2]  W. Tobler,et al.  A CONTINUOUS TRANSFORMATION USEFUL FOR DISTRICTING , 1973 .

[3]  Barbara Tversky,et al.  Cognitive Maps, Cognitive Collages, and Spatial Mental Models , 1993, COSIT.

[4]  Kozo Sugiyama,et al.  Layout Adjustment and the Mental Map , 1995, J. Vis. Lang. Comput..

[5]  Donald H. House,et al.  Continuous cartogram construction , 1998 .

[6]  David G. Kirkpatrick,et al.  Unit disk graph recognition is NP-hard , 1998, Comput. Geom..

[7]  Petr Hlinený.  Contact graphs of line segments are NP-complete , 2001, Discret. Math..

[8]  Ben Shneiderman,et al.  Ordered treemap layouts , 2001, IEEE Symposium on Information Visualization, 2001. INFOVIS 2001..

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

[10]  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.

[11]  Daniel A. Keim,et al.  RecMap: Rectangular Map Approximations , 2004 .

[12]  Bettina Speckmann,et al.  On rectangular cartograms , 2007 .

[13]  Bettina Speckmann,et al.  Area-universal rectangular layouts , 2009, SCG '09.

[14]  Bettina Speckmann,et al.  A splitting line model for directional relations , 2011, GIS.

[15]  D. Dorling.  Area Cartograms: Their Use and Creation , 2011 .

[16]  Bettina Speckmann,et al.  Evolution Strategies for Optimizing Rectangular Cartograms , 2012, GIScience.

[17]  Stefan Felsner,et al.  Computing Cartograms with Optimal Complexity , 2013, Discret. Comput. Geom..

[18]  Tamara Munzner,et al.  Visualization Analysis and Design , 2014, A.K. Peters visualization series.

[19]  Stephen G. Kobourov,et al.  Quantitative Measures for Cartogram Generation Techniques , 2015, Comput. Graph. Forum.

[20]  Michael Kaufmann,et al.  Low ply graph drawing , 2015, 2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA).

[21]  Csaba D. Tóth,et al.  Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees , 2015, GD.

[22]  Martin Nöllenburg,et al.  Recognizing Weighted Disk Contact Graphs , 2015, GD.

[23]  Bettina Speckmann,et al.  Improved Grid Map Layout by Point Set Matching , 2015, Int. J. Comput. Geom. Appl..

[24]  Stephen G. Kobourov,et al.  Analyzing the Evolution of the Internet , 2015, EuroVis.

[25]  Stephen G. Kobourov,et al.  The State of the Art in Cartograms , 2016, Comput. Graph. Forum.

[26]  Wouter Meulemans,et al.  Small Multiples with Gaps , 2017, IEEE Transactions on Visualization and Computer Graphics.

[27]  Bettina Speckmann,et al.  Stable Treemaps via Local Moves , 2018, IEEE Transactions on Visualization and Computer Graphics.

[28]  Wouter Meulemans,et al.  Efficient Optimal Overlap Removal: Algorithms and Experiments , 2019, Comput. Graph. Forum.