TL;DR
This paper presents a novel flow-based algorithm for creating density-equalizing cartogram projections that significantly reduces computation time while maintaining accuracy, enabling quick and detailed geographic data visualizations.
Contribution
The authors introduce a faster, parallelizable flow-based algorithm for generating cartograms that preserves shape and area accuracy, improving upon previous physics-inspired methods.
Findings
Calculation time reduced to a few seconds for complex maps
Maintains shape distortion and area accuracy comparable to existing methods
Successfully applied to election data, economic indicators, and demographic distributions
Abstract
Cartograms are maps that rescale geographic regions (e.g., countries, districts) such that their areas are proportional to quantitative demographic data (e.g., population size, gross domestic product). Unlike conventional bar or pie charts, cartograms can represent correctly which regions share common borders, resulting in insightful visualizations that can be the basis for further spatial statistical analysis. Computer programs can assist data scientists in preparing cartograms, but developing an algorithm that can quickly transform every coordinate on the map (including points that are not exactly on a border) while generating recognizable images has remained a challenge. Methods that translate the cartographic deformations into physics-inspired equations of motion have become popular, but solving these equations with sufficient accuracy can still take several minutes on current…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
