Many-to-One Boundary Labeling with Backbones

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

Many-to-One Boundary Labeling with Backbones

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2013

Autor:innen

Bekos, Michael A.

Cornelsen, Sabine

Fink, Martin

Hong, Seok-Hee

Kaufmann, Michael

Nöllenburg, Martin

Rutter, Ignaz

Symvonis, Antonios

DOI (zitierfähiger Link)

10.1007/978-3-319-03841-4_22

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

Graph Drawing : 21st International Symposium, GD 2013, Revised Selected Papers / Wismath, Stephen; Wolff, Alexander (Hrsg.). - Cham : Springer, 2013. - (Lecture Notes in Computer Science ; 8242). - S. 244-255. - ISSN 0302-9743. - eISSN 1611-3349. - ISBN 978-3-319-03840-7

Zusammenfassung

In this paper we study many-to-one boundary labeling with backbone leaders. In this model, a horizontal backbone reaches out of each label into the feature-enclosing rectangle. Feature points associated with this label are linked via vertical line segments to the backbone. We present algorithms for label number and leader-length minimization. If crossings are allowed, we aim to minimize their number. This can be achieved efficiently in the case of fixed label order. We show that the corresponding problem in the case of flexible label order is NP-hard.

Fachgebiet (DDC)

004 Informatik

Konferenz

Graph Drawing : 21st International Symposium, GD 2013, 23. Sep. 2013 - 25. Sep. 2013, Bordeaux, France

Zitieren

ISO 690

BEKOS, Michael A., Sabine CORNELSEN, Martin FINK, Seok-Hee HONG, Michael KAUFMANN, Martin NÖLLENBURG, Ignaz RUTTER, Antonios SYMVONIS, 2013. Many-to-One Boundary Labeling with Backbones. Graph Drawing : 21st International Symposium, GD 2013. Bordeaux, France, 23. Sep. 2013 - 25. Sep. 2013. In: WISMATH, Stephen, ed., Alexander WOLFF, ed.. Graph Drawing : 21st International Symposium, GD 2013, Revised Selected Papers. Cham:Springer, pp. 244-255. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-03840-7. Available under: doi: 10.1007/978-3-319-03841-4_22

BibTex

@inproceedings{Bekos2013Manyt-44794,
  year={2013},
  doi={10.1007/978-3-319-03841-4_22},
  title={Many-to-One Boundary Labeling with Backbones},
  number={8242},
  isbn={978-3-319-03840-7},
  issn={0302-9743},
  publisher={Springer},
  address={Cham},
  series={Lecture Notes in Computer Science},
  booktitle={Graph Drawing : 21st International Symposium, GD 2013, Revised Selected Papers},
  pages={244--255},
  editor={Wismath, Stephen and Wolff, Alexander},
  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/44794">
    <dcterms:abstract xml:lang="eng">In this paper we study many-to-one boundary labeling with backbone leaders. In this model, a horizontal backbone reaches out of each label into the feature-enclosing rectangle. Feature points associated with this label are linked via vertical line segments to the backbone. We present algorithms for label number and leader-length minimization. If crossings are allowed, we aim to minimize their number. This can be achieved efficiently in the case of fixed label order. We show that the corresponding problem in the case of flexible label order is NP-hard.</dcterms:abstract>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-31T13:55:27Z</dc:date>
    <dc:contributor>Kaufmann, Michael</dc:contributor>
    <dc:contributor>Hong, Seok-Hee</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-01-31T13:55:27Z</dcterms:available>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Cornelsen, Sabine</dc:contributor>
    <dc:creator>Fink, Martin</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Nöllenburg, Martin</dc:creator>
    <dc:creator>Symvonis, Antonios</dc:creator>
    <dc:creator>Hong, Seok-Hee</dc:creator>
    <dcterms:title>Many-to-One Boundary Labeling with Backbones</dcterms:title>
    <dc:contributor>Symvonis, Antonios</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:contributor>Rutter, Ignaz</dc:contributor>
    <dc:creator>Rutter, Ignaz</dc:creator>
    <dc:contributor>Bekos, Michael A.</dc:contributor>
    <dc:creator>Bekos, Michael A.</dc:creator>
    <dc:contributor>Nöllenburg, Martin</dc:contributor>
    <dcterms:issued>2013</dcterms:issued>
    <dc:creator>Cornelsen, Sabine</dc:creator>
    <dc:creator>Kaufmann, Michael</dc:creator>
    <dc:contributor>Fink, Martin</dc:contributor>
    <dc:language>eng</dc:language>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44794"/>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja