Publikation:

Overlap Removal Methods for Data Projection Algorithms

Vorschaubild

Dateien

Bachelorarb_Spicker.pdf
Bachelorarb_Spicker.pdfGröße: 2.76 MBDownloads: 2281

Datum

2011

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-161987
DOI (zitierfähiger Link)
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

Überlappungsbereinigung für Algorithmen zur Datenprojektion
Publikationstyp
Bachelorarbeit
Publikationsstatus
Published

Erschienen in

Zusammenfassung

Projection algorithms map high dimensional data points to lower dimensions. However, when adding arbitrary shaped objects as representatives for these data points, they may intersect. The positions of these representatives have to be modi ed in order to remove existing overlaps. There are multiple algorithms designed to deal with this layout adjustment problem, which lead to very di erent results. These adjustment strategies are evaluated according to di erent measures for comparison: euclidean distance, area occupancy, and orthogonal ordering. Four common overlap removal algorithms are adopted and evaluated. Taking drawbacks of the observed algorithms into account, a new overlap removal algorithm has been developed. Finally, measures underlay improvements of the new algorithm.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

overlap removal, layout adjustment, mental map, box2D, wordle, voronoi, vpsc

Konferenz

Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690SPICKER, Marc, 2011. Overlap Removal Methods for Data Projection Algorithms [Bachelor thesis]
BibTex
@mastersthesis{Spicker2011Overl-16198,
  year={2011},
  title={Overlap Removal Methods for Data Projection Algorithms},
  author={Spicker, Marc}
}
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/16198">
    <dcterms:issued>2011</dcterms:issued>
    <dcterms:title>Overlap Removal Methods for Data Projection Algorithms</dcterms:title>
    <dc:creator>Spicker, Marc</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-11-09T09:12:55Z</dcterms:available>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:language>eng</dc:language>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:abstract xml:lang="eng">Projection algorithms map high dimensional data points to lower dimensions. However, when adding arbitrary shaped objects as representatives for these data points, they may intersect. The positions of these representatives have to be modi ed in order to remove existing overlaps. There are multiple algorithms designed to deal with this layout adjustment problem, which lead to very di erent results. These adjustment strategies are evaluated according to di erent measures for comparison: euclidean distance, area occupancy, and orthogonal ordering. Four common overlap removal algorithms are adopted and evaluated. Taking drawbacks of the observed algorithms into account, a new overlap removal algorithm has been developed. Finally, measures underlay improvements of the new algorithm.</dcterms:abstract>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-11-09T09:12:55Z</dc:date>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/16198/2/Bachelorarb_Spicker.pdf"/>
    <dc:contributor>Spicker, Marc</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/16198/2/Bachelorarb_Spicker.pdf"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:alternative>Überlappungsbereinigung für Algorithmen zur Datenprojektion</dcterms:alternative>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/16198"/>
  </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