Capacity-Constrained Voronoi Diagrams in Finite Spaces

Lade...
Vorschaubild
Datum
2008
Autor:innen
Balzer, Michael
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
ArXiv-ID
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Gesperrt bis
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
Proceedings of the 5 th Annual International Symposium on Voronoi Diagrams in Science and Engineering, 22 - 28 September, 2008, Kiev, Ukraine. 2008
Zusammenfassung

A Voronoi diagram of a set of n sites partitions a finite set of m points into regions of different areas, called the capacities of the sites. In this paper we are interested in Voronoi diagrams in which the capacities are given as constraints. We compute such capacity-constrained Voronoi diagrams in finite spaces by starting with an arbitrary partition that fulfills the capacity constraint without representing a valid Voronoi diagram. We then iteratively swap the assignment of points to sites guided by an energy minimization that is related to the distance function of the Voronoi diagram. This optimization converges towards a valid Voronoi diagram that fulfills the capacity constraint due to the restriction to swap operations. The straightforward structure of our algorithm makes it easy to implement and flexible. The computational time complexity for each iteration step is O(n2+nmlog m/n). We provide examples for extensions of our algorithm such as applying different energy functions, or generating Voronoi diagrams with centroidal and/or void regions.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Voronoi diagram, capacity constraint, finite space, power diagram, leastsquares, centroidal Voronoi diagram
Konferenz
Voronoi Diagrams in Science and Engineering, 22. Sept. 2008 - 28. Sept. 2008, Kiev, Ukraine
Rezension
undefined / . - undefined, undefined
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Datensätze
Zitieren
ISO 690BALZER, Michael, Daniel HECK, 2008. Capacity-Constrained Voronoi Diagrams in Finite Spaces. Voronoi Diagrams in Science and Engineering. Kiev, Ukraine, 22. Sept. 2008 - 28. Sept. 2008. In: Proceedings of the 5 th Annual International Symposium on Voronoi Diagrams in Science and Engineering, 22 - 28 September, 2008, Kiev, Ukraine. 2008
BibTex
@inproceedings{Balzer2008Capac-5419,
  year={2008},
  title={Capacity-Constrained Voronoi Diagrams in Finite Spaces},
  booktitle={Proceedings of the 5 th Annual International Symposium on Voronoi Diagrams in Science and Engineering, 22 - 28 September, 2008, Kiev, Ukraine},
  author={Balzer, Michael and Heck, Daniel}
}
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/5419">
    <dc:creator>Balzer, Michael</dc:creator>
    <dcterms:issued>2008</dcterms:issued>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5419/1/Capacity_Constrained_Voronoi_Diagrams_in_Finite_Spaces.avi"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5419/2/Capacity_Constrained_Voronoi_Diagrams_in_Finite_Spaces.pdf"/>
    <dc:format>unknown</dc:format>
    <dcterms:bibliographicCitation>Also publ. as paper in: Proceedings of the 5th Annual International Symposium on Voronoi Diagrams in Science and Engineering, 22-28 September, 2008, Kiev, Ukraine</dcterms:bibliographicCitation>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5419/1/Capacity_Constrained_Voronoi_Diagrams_in_Finite_Spaces.avi"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Heck, Daniel</dc:contributor>
    <dc:creator>Heck, Daniel</dc:creator>
    <dc:format>application/pdf</dc:format>
    <dc:language>deu</dc:language>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5419"/>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:14Z</dcterms:available>
    <dcterms:abstract xml:lang="eng">A Voronoi diagram of a set of n sites partitions a finite set of m points into regions of different areas, called the capacities of the sites. In this paper we are interested in Voronoi diagrams in which the capacities are given as constraints. We compute such capacity-constrained Voronoi diagrams in finite spaces by starting with an arbitrary partition that fulfills the capacity constraint without representing a valid Voronoi diagram. We then iteratively swap the assignment of points to sites guided by an energy minimization that is related to the distance function of the Voronoi diagram. This optimization converges towards a valid Voronoi diagram that fulfills the capacity constraint due to the restriction to swap operations. The straightforward structure of our algorithm makes it easy to implement and flexible. The computational time complexity for each iteration step is O(n2+nmlog m/n). We provide examples for extensions of our algorithm such as applying different energy functions, or generating Voronoi diagrams with centroidal and/or void regions.</dcterms:abstract>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:14Z</dc:date>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:title>Capacity-Constrained Voronoi Diagrams in Finite Spaces</dcterms:title>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5419/2/Capacity_Constrained_Voronoi_Diagrams_in_Finite_Spaces.pdf"/>
    <dc:contributor>Balzer, 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
Diese Publikation teilen