{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","month":"04","title":"A combinatorial approach to cartograms","page":"343 - 360","article_processing_charge":"No","doi":"10.1016/S0925-7721(96)00006-5","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0925772196000065"}],"publication_status":"published","oa":1,"issue":"5-6","date_created":"2018-12-11T12:06:29Z","author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"first_name":"Roman","full_name":"Waupotitsch, Roman","last_name":"Waupotitsch"}],"_id":"4021","publication_identifier":{"issn":["0925-7721"]},"extern":"1","intvolume":"         7","acknowledgement":"The authors thank Jack Snoeyink for bringing the cartogram problem to their attention, and Michael McAllister for providing pointers to the literature on cartograms. ","publication":"Computational Geometry: Theory and Applications","date_updated":"2022-08-19T08:12:03Z","article_type":"original","publisher":"Elsevier","status":"public","day":"01","citation":{"chicago":"Edelsbrunner, Herbert, and Roman Waupotitsch. “A Combinatorial Approach to Cartograms.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 1997. <a href=\"https://doi.org/10.1016/S0925-7721(96)00006-5\">https://doi.org/10.1016/S0925-7721(96)00006-5</a>.","apa":"Edelsbrunner, H., &#38; Waupotitsch, R. (1997). A combinatorial approach to cartograms. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0925-7721(96)00006-5\">https://doi.org/10.1016/S0925-7721(96)00006-5</a>","short":"H. Edelsbrunner, R. Waupotitsch, Computational Geometry: Theory and Applications 7 (1997) 343–360.","mla":"Edelsbrunner, Herbert, and Roman Waupotitsch. “A Combinatorial Approach to Cartograms.” <i>Computational Geometry: Theory and Applications</i>, vol. 7, no. 5–6, Elsevier, 1997, pp. 343–60, doi:<a href=\"https://doi.org/10.1016/S0925-7721(96)00006-5\">10.1016/S0925-7721(96)00006-5</a>.","ieee":"H. Edelsbrunner and R. Waupotitsch, “A combinatorial approach to cartograms,” <i>Computational Geometry: Theory and Applications</i>, vol. 7, no. 5–6. Elsevier, pp. 343–360, 1997.","ista":"Edelsbrunner H, Waupotitsch R. 1997. A combinatorial approach to cartograms. Computational Geometry: Theory and Applications. 7(5–6), 343–360.","ama":"Edelsbrunner H, Waupotitsch R. A combinatorial approach to cartograms. <i>Computational Geometry: Theory and Applications</i>. 1997;7(5-6):343-360. doi:<a href=\"https://doi.org/10.1016/S0925-7721(96)00006-5\">10.1016/S0925-7721(96)00006-5</a>"},"publist_id":"2105","abstract":[{"text":"A homeomorphism from R-2 to itself distorts metric quantities, such as distance and area. We describe an algorithm that constructs homeomorphisms with prescribed area distortion. Such homeomorphisms can be used to generate cartograms, which are geographic maps purposely distorted so their area distributions reflects a variable different from area, as for example population density. The algorithm generates the homeomorphism through a sequence of local piecewise linear homeomorphic changes. Sample results produced by the preliminary implementation of the method are included.","lang":"eng"}],"type":"journal_article","language":[{"iso":"eng"}],"popular_science":"1","year":"1997","volume":7,"date_published":"1997-04-01T00:00:00Z","oa_version":"Published Version"}