Publikation:

Rolled-out wordles : a heuristic method for overlap removal of 2D data representatives

Vorschaubild

Dateien

Strobelt_222807.pdf
Strobelt_222807.pdfGröße: 1.51 MBDownloads: 880

Datum

2012

Autor:innen

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
http://nbn-resolving.de/urn:nbn:de:bsz:352-222807
DOI (zitierfähiger Link)
https://doi.org/10.1111/j.1467-8659.2012.03106.x
ArXiv-ID

Internationale Patentnummer

Link zur Lizenz
Urheberrechtlich geschützt

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Green

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published

Erschienen in

Computer Graphics Forum. 2012, 31(3pt3), pp. 1135-1144. ISSN 0167-7055. eISSN 1467-8659. Available under: doi: 10.1111/j.1467-8659.2012.03106.x

Zusammenfassung

When representing 2D data points with spacious objects such as labels, overlap can occur. We present a simple algorithm which modifies the (Mani-) Wordle idea with scan-line based techniques to allow a better placement. We give an introduction to common placement techniques from different fields and compare our method to these techniques w.r.t. euclidean displacement, changes in orthogonal ordering as well as shape and size preservation. Especially in dense scenarios our method preserves the overall shape better than known techniques and allows a good trade-off between the other measures. Applications on real world data are given and discussed.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690STROBELT, Hendrik, Marc SPICKER, Andreas STOFFEL, Daniel A. KEIM, Oliver DEUSSEN, 2012. Rolled-out wordles : a heuristic method for overlap removal of 2D data representatives. In: Computer Graphics Forum. 2012, 31(3pt3), pp. 1135-1144. ISSN 0167-7055. eISSN 1467-8659. Available under: doi: 10.1111/j.1467-8659.2012.03106.x
BibTex
@article{Strobelt2012Rolle-22280,
  year={2012},
  doi={10.1111/j.1467-8659.2012.03106.x},
  title={Rolled-out wordles : a heuristic method for overlap removal of 2D data representatives},
  number={3pt3},
  volume={31},
  issn={0167-7055},
  journal={Computer Graphics Forum},
  pages={1135--1144},
  author={Strobelt, Hendrik and Spicker, Marc and Stoffel, Andreas and Keim, Daniel A. and Deussen, Oliver}
}
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/22280">
    <dc:creator>Strobelt, Hendrik</dc:creator>
    <dc:contributor>Stoffel, Andreas</dc:contributor>
    <dc:creator>Stoffel, Andreas</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-03-04T09:57:24Z</dc:date>
    <dcterms:bibliographicCitation>Computer Graphics Forum ; 31 (2012), 3pt3. - S. 1135-1144</dcterms:bibliographicCitation>
    <dc:contributor>Keim, Daniel A.</dc:contributor>
    <dc:contributor>Spicker, Marc</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-03-04T09:57:24Z</dcterms:available>
    <dc:creator>Deussen, Oliver</dc:creator>
    <dc:rights>terms-of-use</dc:rights>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Keim, Daniel A.</dc:creator>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22280/2/Strobelt_222807.pdf"/>
    <dcterms:title>Rolled-out wordles : a heuristic method for overlap removal of 2D data representatives</dcterms:title>
    <dc:contributor>Deussen, Oliver</dc:contributor>
    <dcterms:issued>2012</dcterms:issued>
    <dc:language>eng</dc:language>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Spicker, Marc</dc:creator>
    <dcterms:abstract xml:lang="eng">When representing 2D data points with spacious objects such as labels, overlap can occur. We present a simple algorithm which modifies the (Mani-) Wordle idea with scan-line based techniques to allow a better placement. We give an introduction to common placement techniques from different fields and compare our method to these techniques w.r.t. euclidean displacement, changes in orthogonal ordering as well as shape and size preservation. Especially in dense scenarios our method preserves the overall shape better than known techniques and allows a good trade-off between the other measures. Applications on real world data are given and discussed.</dcterms:abstract>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/22280"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/22280/2/Strobelt_222807.pdf"/>
    <dc:contributor>Strobelt, Hendrik</dc:contributor>
  </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
Ja
Begutachtet
Diese Publikation teilen