Publikation:

Crushing Disks Efficiently

Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2016

Autor:innen

Funke, Stefan
Krumpe, Filip

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.1007/978-3-319-44543-4_4
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
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

MÄKINEN, Veli, ed. and others. Combinatorial Algorithms : 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, proceedings. Cham: Springer, 2016, pp. 43-54. Lecture Notes in Computer Science. 9843. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-44542-7. Available under: doi: 10.1007/978-3-319-44543-4_4

Zusammenfassung

Given a set of prioritized disks with fixed centers in R2 whose radii grow linearly over time, we are interested in computing an elimination order of these disks assuming that when two disks touch, the one with lower priority is ‘crushed’. A straightforward algorithm has running time O(n2log n) which we improve to expected O(n(log6n+Δ2log2n+Δ4log n)) where Δ is the ratio between largest and smallest radii amongst the disks. For a very natural application of this problem in the map rendering domain, we have Δ=O(1).

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

27th International Workshop, IWOCA 2016, 17. Aug. 2016 - 19. Aug. 2016, Helsinki, Finland
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690FUNKE, Stefan, Filip KRUMPE, Sabine STORANDT, 2016. Crushing Disks Efficiently. 27th International Workshop, IWOCA 2016. Helsinki, Finland, 17. Aug. 2016 - 19. Aug. 2016. In: MÄKINEN, Veli, ed. and others. Combinatorial Algorithms : 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, proceedings. Cham: Springer, 2016, pp. 43-54. Lecture Notes in Computer Science. 9843. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-44542-7. Available under: doi: 10.1007/978-3-319-44543-4_4
BibTex
@inproceedings{Funke2016-08-09Crush-43521,
  year={2016},
  doi={10.1007/978-3-319-44543-4_4},
  title={Crushing Disks Efficiently},
  number={9843},
  isbn={978-3-319-44542-7},
  issn={0302-9743},
  publisher={Springer},
  address={Cham},
  series={Lecture Notes in Computer Science},
  booktitle={Combinatorial Algorithms : 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, proceedings},
  pages={43--54},
  editor={Mäkinen, Veli},
  author={Funke, Stefan and Krumpe, Filip and Storandt, Sabine}
}
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/43521">
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Storandt, Sabine</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:abstract xml:lang="eng">Given a set of prioritized disks with fixed centers in R&lt;sup&gt;2&lt;/sup&gt; whose radii grow linearly over time, we are interested in computing an elimination order of these disks assuming that when two disks touch, the one with lower priority is ‘crushed’. A straightforward algorithm has running time O(n&lt;sup&gt;2&lt;/sup&gt;log n) which we improve to expected O(n(log&lt;sup&gt;6&lt;/sup&gt;n+Δ&lt;sup&gt;2&lt;/sup&gt;log&lt;sup&gt;2&lt;/sup&gt;n+Δ&lt;sup&gt;4&lt;/sup&gt;log n)) where Δ is the ratio between largest and smallest radii amongst the disks. For a very natural application of this problem in the map rendering domain, we have Δ=O(1).</dcterms:abstract>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-10-15T09:44:57Z</dcterms:available>
    <dc:contributor>Krumpe, Filip</dc:contributor>
    <dc:creator>Funke, Stefan</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-10-15T09:44:57Z</dc:date>
    <dc:language>eng</dc:language>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Storandt, Sabine</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Funke, Stefan</dc:contributor>
    <dc:creator>Krumpe, Filip</dc:creator>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/43521"/>
    <dcterms:issued>2016-08-09</dcterms:issued>
    <dcterms:title>Crushing Disks Efficiently</dcterms:title>
  </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