Publikation:

Many-to-One Boundary Labeling with Backbones

Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2015

Autor:innen

Bekos, Michael A.
Fink, Martin
Hong, Seok-Hee
Kaufmann, Michael
Nöllenburg, Martin
Rutter, Ignaz
Symvonis, Antonios

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
DOI (zitierfähiger Link)
https://doi.org/10.7155/jgaa.00379
ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung

Sammlungen

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

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published

Erschienen in

Journal of Graph Algorithms and Applications. 2015, 19(3), pp. 779-816. eISSN 1526-1719. Available under: doi: 10.7155/jgaa.00379

Zusammenfassung

We study a boundary labeling problem, where multiple points may connect to the same label. In this new many-to-one model, a horizontal backbone reaches out of each label into the feature-enclosing rectangle. Feature points that need to be connected to this label are linked via ver- tical line segments to the backbone. We present dynamic programming algorithms for minimizing the total number of label occurrences and for minimizing the total leader length of crossing-free backbone labelings. When crossings are allowed, we aim at obtaining solutions with the min- imum number of crossings. This can be achieved e ciently in the case of xed label order; however, in the case of exible label order we show that minimizing the number of leader crossings is NP-hard.

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 690BEKOS, Michael A., Sabine CORNELSEN, Martin FINK, Seok-Hee HONG, Michael KAUFMANN, Martin NÖLLENBURG, Ignaz RUTTER, Antonios SYMVONIS, 2015. Many-to-One Boundary Labeling with Backbones. In: Journal of Graph Algorithms and Applications. 2015, 19(3), pp. 779-816. eISSN 1526-1719. Available under: doi: 10.7155/jgaa.00379
BibTex
@article{Bekos2015Manyt-44793,
  year={2015},
  doi={10.7155/jgaa.00379},
  title={Many-to-One Boundary Labeling with Backbones},
  number={3},
  volume={19},
  journal={Journal of Graph Algorithms and Applications},
  pages={779--816},
  author={Bekos, Michael A. and Cornelsen, Sabine and Fink, Martin and Hong, Seok-Hee and Kaufmann, Michael and Nöllenburg, Martin and Rutter, Ignaz and Symvonis, Antonios}
}
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/44793">
    <dc:language>eng</dc:language>
    <dc:creator>Symvonis, Antonios</dc:creator>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-31T13:50:08Z</dcterms:available>
    <dcterms:issued>2015</dcterms:issued>
    <dc:contributor>Fink, Martin</dc:contributor>
    <dc:creator>Fink, Martin</dc:creator>
    <dc:creator>Rutter, Ignaz</dc:creator>
    <dc:creator>Bekos, Michael A.</dc:creator>
    <dcterms:title>Many-to-One Boundary Labeling with Backbones</dcterms:title>
    <dc:contributor>Hong, Seok-Hee</dc:contributor>
    <dc:contributor>Symvonis, Antonios</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Cornelsen, Sabine</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44793"/>
    <dc:contributor>Rutter, Ignaz</dc:contributor>
    <dc:contributor>Bekos, Michael A.</dc:contributor>
    <dc:creator>Hong, Seok-Hee</dc:creator>
    <dc:creator>Kaufmann, Michael</dc:creator>
    <dc:contributor>Nöllenburg, Martin</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:abstract xml:lang="eng">We study a boundary labeling problem, where multiple points may connect to the same label. In this new many-to-one model, a horizontal backbone reaches out of each label into the feature-enclosing rectangle. Feature points that need to be connected to this label are linked via ver- tical line segments to the backbone. We present dynamic programming algorithms for minimizing the total number of label occurrences and for minimizing the total leader length of crossing-free backbone labelings. When crossings are allowed, we aim at obtaining solutions with the min- imum number of crossings. This can be achieved e ciently in the case of xed label order; however, in the case of exible label order we show that minimizing the number of leader crossings is NP-hard.</dcterms:abstract>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Nöllenburg, Martin</dc:creator>
    <dc:creator>Cornelsen, Sabine</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-31T13:50:08Z</dc:date>
    <dc:contributor>Kaufmann, Michael</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
Ja
Diese Publikation teilen