A linear programming approach computes stable Demers cartograms that keep adjacent regions close and reduce layout movement across data values, with short leaders for broken adjacencies.
Computer Graphics Forum 34(3), 351–360 (2015)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Computing Stable Demers Cartograms
A linear programming approach computes stable Demers cartograms that keep adjacent regions close and reduce layout movement across data values, with short leaders for broken adjacencies.