An Optimized Rubber-Sheet Algorithm for Continuous Area Cartograms
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract This article optimizes a continuous area cartogram algorithm published in The Professional Geographer by Dougenik, Chrisman, and Niemeyer (DCN) in 1985. The DCN algorithm simulates a rubber sheet and is an iterative and approximate solution of cartogram construction. Although it remains popular because of its conceptual simplicity and cartographic quality, the DCN algorithm cannot completely preserve topology and its mathematical properties are inadequately explained. This article presents an optimization to the DCN algorithm, named Opti-DCN, with three improvements. First, it provides a mathematical condition for topology preservation. Second, new transformation equations that meet this condition are deduced from mathematics, which simultaneously optimize the global elasticity coefficient, a key parameter that greatly impacts the convergence rate of the rubber-sheet algorithm and the topological integrity of its generated cartograms. Last, the new algorithm simplifies the way of generating transforming forces in DCN and improves its efficiency of geometric transformation. Comparison shows that Opti-DCN is significantly faster to converge to equal-density cartograms and can mathematically and practically eliminate topological errors. En este artículo se optimiza un algoritmo de cartograma de área continua publicado en The Professional Geographer por Dougenik, Chrisman y Niemeyer (DCN) en 1985. El algoritmo de DCN simula una lámina de caucho y es una solución iterativa y aproximada para la construcción de cartogramas. Aunque sigue siendo popular debido a su simplicidad conceptual y calidad cartográfica, el algoritmo de DCN no puede preservar totalmente la topología y además sus propiedades matemáticas se explican de manera inadecuada. El presente artículo presenta una optimización del algoritmo DCN, identificada con el nombre Opti-DCN, al cual se le introducen tres mejoras. Primero, suministra una condición matemática para la preservación topológica. Segundo, las nuevas ecuaciones de transformación que satisfacen esa condición se deducen de la matemática, lo cual simultáneamente optimiza el coeficiente de elasticidad global, parámetro clave que impacta fuertemente la tasa de convergencia del algoritmo lámina de caucho y la integridad topológica de los cartogramas que genere. Por último, el nuevo algoritmo simplifica la manera de generar fuerzas transformadoras en el DCN y mejora su eficiencia de transformación geométrica. La comparación permite ver que el Opti-DCN es significativamente más rápido para converger en cartogramas de igual densidad y puede eliminar errores topológicos de manera matemática y práctica. Key Words: algorithm optimizationcontinuous area cartogramrubber-sheet algorithm关键词: 算法优化连续区域统计地图橡胶板算法Palabras clave: optimización algorítmicacartograma de área continuaalgoritmo de lámina de caucho Acknowledgments Notes *This work is supported in part by the National Aeronautics and Space Administration New Investigator Program in Earth-Sun System Science (NNX06AE85G) and the University of Minnesota. The author gratefully acknowledges the efforts of the editor and three anonymous reviewers for their valuable comments and constructive suggestions. As always, the author takes full responsibility for any remaining errors or omissions.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it