Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Cartogram
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Algorithms === [[File:EU net budget 2007-2013 per capita cartogram.png|thumb|upright=1.15|Cartogram (likely Gastner-Newman) showing [[Open Europe]] estimate of total [[European Union]] net budget expenditure in euros for the whole period 2007β2013, ''per capita'', based on [[Eurostat]] 2007 pop. estimates (Luxembourg not shown). <br /> '''Net contributors''' {{legend|#A20029|β5000 to β1000 euro per capita}} {{legend|#EC2220|β1000 to β500 euro per capita}} {{legend|#FF7900|β500 to 0 euro per capita}} '''Net recipients''' {{legend|#FFEF00|0 to 500 euro per capita}} {{legend|#2DA842|500 to 1000 euro per capita}} {{legend|#08AEE2|1000 to 5000 euro per capita}} {{legend|#566BE9|5000 to 10000 euro per capita}} {{legend|#000000|10000 euro plus per capita}}]] {| class="wikitable sortable" |- ! Year !! Author !! Algorithm !! Type !! Shape preservation !! Topology preservation |- | 1973||[[Waldo R. Tobler|Tobler]]||Rubber map method|| area contiguous||with distortion || Yes, but not guaranteed |- | 1976||Olson||Projector method|| area noncontiguous||yes || No |- | 1978||Kadmon, Shlomi||Polyfocal projection || distance radial|| Unknown|| Unknown |- | 1984||Selvin et al.||DEMP (Radial Expansion) method||area contiguous||with distortion|| Unknown |- | 1985||Dougenik et al.||Rubber Sheet Distortion method <ref name="DCN" />||area contiguous||with distortion || Yes, but not guaranteed |- | 1986||[[Waldo R. Tobler|Tobler]]||Pseudo-Cartogram method||area contiguous||with distortion|| Yes |- | 1987||Snyder||Magnifying glass azimuthal map projections|| distance radial|| Unknown|| Unknown |- | 1989||{{Interlanguage link|Colette Cauvin|fr}} et al.||Piezopleth maps||area contiguous||with distortion|| Unknown |- | 1990||Torguson||Interactive polygon zipping method||area contiguous||with distortion|| Unknown |- | 1990||[[Danny Dorling|Dorling]]||Cellular Automata Machine method||area contiguous||with distortion||Yes |- | 1993||Gusein-Zade, Tikunov||Line Integral method||area contiguous||with distortion|| Yes |- | 1996||[[Danny Dorling|Dorling]]||Circular cartogram||area noncontiguous||no (circles)|| No |- | 1997||Sarkar, Brown||Graphical fisheye views|| distance radial|| Unknown|| Unknown |- | 1997||[[Herbert Edelsbrunner|Edelsbrunner]], Waupotitsch||Combinatorial-based approach||area contiguous||with distortion|| Unknown |- | 1998||Kocmoud, House||Constraint-based approach||area contiguous||with distortion|| Yes |- | 2001||[[Daniel A. Keim|Keim]], North, Panse||CartoDraw<ref name="CartoDraw">{{cite journal|last1=Keim|first1=Daniel|last2=North|first2=Stephen|last3=Panse|first3=Christian|title=CartoDraw: a fast algorithm for generating contiguous cartograms.|journal=IEEE Trans Vis Comput Graph|date=2004|volume=10|issue=1|pages=95β110|doi=10.1109/TVCG.2004.1260761|pmid=15382701|s2cid=9726148}}</ref>||area contiguous||with distortion|| Yes, algorithmically guaranteed |- | 2004||Gastner, Newman||Diffusion-based method<ref name="GN-Diffusion">[http://www.pnas.org/content/101/20/7499.full Gastner, Michael T. and Mark E. J. Newman, "Diffusion-based method for producing density-equalizing maps." ''Proceedings of the National Academy of Sciences'' 2004; 101: 7499β7504].</ref>||area contiguous||with distortion || Yes, algorithmically guaranteed |- | 2004||Sluga||Lastna tehnika za izdelavo anamorfoz||area contiguous||with distortion|| Unknown |- | 2004||van Kreveld, Speckmann||Rectangular Cartogram<ref name="BettinaSpeckmann2004">{{cite conference|last1=van Kreveld|first1=Marc|last2=Speckmann|first2=Bettina|title=Algorithms β ESA 2004 |chapter=On Rectangular Cartograms |author2-link=Bettina Speckmann|editor1-last=Albers|editor1-first= S.|editor2-last= Radzik|editor2-first= T.|date=2004|volume=3221|pages=724β735|doi=10.1007/978-3-540-30140-0_64|series=Lecture Notes in Computer Science|isbn=978-3-540-23025-0}}</ref>||area contiguous||no (rectangles)|| No |- | 2004||Heilmann, [[Daniel A. Keim|Keim]] et al.||[https://cran.r-project.org/package=recmap RecMap]<ref name="recmap">{{cite book|last1=Heilmann|first1=Roland|last2=Keim|first2=Daniel|last3=Panse|first3=Christian|last4=Sips|first4=Mike|title=IEEE Symposium on Information Visualization |chapter=RecMap: Rectangular Map Approximations |date=2004|pages=33β40|doi=10.1109/INFVIS.2004.57|isbn=978-0-7803-8779-9|s2cid=14266549}}</ref>||area noncontiguous||no (rectangles)|| No |- | 2005||[[Daniel A. Keim|Keim]], North, Panse||Medial-axis-based cartograms<ref name="MCartoDraw">{{cite journal|last1=Keim|first1=Daniel|last3=North|first3=Stephen|last2=Panse|first2=Christian|title=Medial-axis-based cartograms.|journal= IEEE Computer Graphics and Applications|date=2005|volume=25|issue=3|pages=60β68|doi=10.1109/MCG.2005.64|pmid=15943089|s2cid=6012366|url=https://kops.uni-konstanz.de/bitstream/123456789/5543/1/CGA2005.pdf|url-access=}}</ref>||area contiguous||with distortion|| Yes, algorithmically guaranteed |- | 2009||Heriques, BaΓ§Γ£o, Lobo||Carto-SOM||area contiguous||with distortion|| Yes |- | 2013||Shipeng Sun ||Opti-DCN<ref name="Sun_Opti-DCN" /> and Carto3F<ref name="Sun_Carto3F" />||area contiguous||with distortion || Yes, algorithmically guaranteed |- | 2014||[[B. S. Daya Sagar]]||Mathematical Morphology-Based Cartograms||area contiguous||with local distortion,<br/>but no global distortion|| No |- | 2018||Gastner, Seguy, More||Fast Flow-Based Method<ref name="GSM-Fast-Flow-Based"/>||area contiguous||with distortion || Yes, algorithmically guaranteed |}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)