CartoDraw : a fast algorithm for generating contiguous cartograms


Dateien zu dieser Ressource

Dateien Größe Format Anzeige

Zu diesem Dokument gibt es keine Dateien.

KEIM, Daniel A., Stephen C. NORTH, Christian PANSE, 2004. CartoDraw : a fast algorithm for generating contiguous cartograms. In: IEEE Transactions on Visualization and Computer Graphics. 10(1), pp. 95-110. ISSN 1077-2626. eISSN 1941-0506. Available under: doi: 10.1109/TVCG.2004.1260761

@article{Keim2004Carto-40666, title={CartoDraw : a fast algorithm for generating contiguous cartograms}, year={2004}, doi={10.1109/TVCG.2004.1260761}, number={1}, volume={10}, issn={1077-2626}, journal={IEEE Transactions on Visualization and Computer Graphics}, pages={95--110}, author={Keim, Daniel A. and North, Stephen C. and Panse, Christian} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <bibo:uri rdf:resource=""/> <dc:creator>Keim, Daniel A.</dc:creator> <dcterms:isPartOf rdf:resource=""/> <dcterms:title>CartoDraw : a fast algorithm for generating contiguous cartograms</dcterms:title> <dc:language>eng</dc:language> <dcterms:issued>2004</dcterms:issued> <dc:contributor>North, Stephen C.</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Panse, Christian</dc:contributor> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:contributor>Keim, Daniel A.</dc:contributor> <dspace:isPartOfCollection rdf:resource=""/> <dc:creator>Panse, Christian</dc:creator> <dc:date rdf:datatype="">2017-11-18T14:17:19Z</dc:date> <dc:creator>North, Stephen C.</dc:creator> <dcterms:abstract xml:lang="eng">Cartograms are a well-known technique for showing geography-related statistical information, such as population demographics and epidemiological data. The basic idea is to distort a map by resizing its regions according to a statistical parameter, but in a way that keeps the map recognizable. In this study, we formally define a family of cartogram drawing problems. We show that even simple variants are unsolvable in the general case. Because the feasible variants are NP-complete, heuristics are needed to solve the problem. Previously proposed solutions suffer from problems with the quality of the generated drawings. For a cartogram to be recognizable, it is important to preserve the global shape or outline of the input map, a requirement that has been overlooked in the past. To address this, our objective function for cartogram drawing includes both global and local shape preservation. To measure the degree of shape preservation, we propose a shape similarity function, which is based on a Fourier transformation of the polygons' curvatures. Also, our application is visualization of dynamic data, for which we need an algorithm that recalculates a cartogram in a few seconds. None of the previous algorithms provides adequate performance with an acceptable level of quality for this application. In this paper, we therefore propose an efficient iterative scanline algorithm to reposition edges while preserving local and global shapes. Scanlines may be generated automatically or entered interactively to guide the optimization process more closely. We apply our algorithm to several example data sets and provide a detailed comparison of the two variants of our algorithm and previous approaches.</dcterms:abstract> <dcterms:available rdf:datatype="">2017-11-18T14:17:19Z</dcterms:available> </rdf:Description> </rdf:RDF>

Das Dokument erscheint in:

KOPS Suche


Mein Benutzerkonto