Publikation:

Efficient cartogram generation : a comparison

Lade...
Vorschaubild

Dateien

InfoVis02.pdf
InfoVis02.pdfGröße: 846.19 KBDownloads: 488

Datum

2002

Autor:innen

North, Stephen C.
Panse, Christian
Schneidewind, Jörn

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.. IEEE Comput. Soc, 2002, pp. 33-36. ISBN 0-7695-1751-X. Available under: doi: 10.1109/INFVIS.2002.1173144

Zusammenfassung

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 paper, we deal with the problem of making continuous cartograms that strictly retain the topology of the input mesh. We compare two algorithms to solve the continuous cartogram problem. The first one uses an iterative relocation of the vertices based on scanlines. The second one is based on the Gridfit technique, which uses pixel-based distortion based on a quadtree-like data structure.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

InfoVis 2002. IEEE Symposium on Information Visualization, Boston, MA, USA
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690KEIM, Daniel A., Stephen C. NORTH, Christian PANSE, Jörn SCHNEIDEWIND, 2002. Efficient cartogram generation : a comparison. InfoVis 2002. IEEE Symposium on Information Visualization. Boston, MA, USA. In: IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.. IEEE Comput. Soc, 2002, pp. 33-36. ISBN 0-7695-1751-X. Available under: doi: 10.1109/INFVIS.2002.1173144
BibTex
@inproceedings{Keim2002Effic-5411,
  year={2002},
  doi={10.1109/INFVIS.2002.1173144},
  title={Efficient cartogram generation : a comparison},
  isbn={0-7695-1751-X},
  publisher={IEEE Comput. Soc},
  booktitle={IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.},
  pages={33--36},
  author={Keim, Daniel A. and North, Stephen C. and Panse, Christian and Schneidewind, Jörn}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/5411">
    <dcterms:title>Efficient cartogram generation : a comparison</dcterms:title>
    <dc:creator>Panse, Christian</dc:creator>
    <dc:format>application/pdf</dc:format>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5411"/>
    <dc:contributor>North, Stephen C.</dc:contributor>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5411/1/InfoVis02.pdf"/>
    <dcterms:bibliographicCitation>First publ. in: InfoVis 2002, IEEE Symposium on Information Visualization, Boston, Massachusetts, 2002, pp. 33-36</dcterms:bibliographicCitation>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Keim, Daniel A.</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <dcterms:issued>2002</dcterms:issued>
    <dc:contributor>Keim, Daniel A.</dc:contributor>
    <dc:creator>North, Stephen C.</dc:creator>
    <dc:contributor>Schneidewind, Jörn</dc:contributor>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dc:creator>Schneidewind, Jörn</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:08Z</dcterms:available>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Panse, Christian</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:08Z</dc:date>
    <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 paper, we deal with the problem of making continuous cartograms that strictly retain the topology of the input mesh. We compare two algorithms to solve the continuous cartogram problem. The first one uses an iterative relocation of the vertices based on scanlines. The second one is based on the Gridfit technique, which uses pixel-based distortion based on a quadtree-like data structure.</dcterms:abstract>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5411/1/InfoVis02.pdf"/>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen