Capacity-Constrained Voronoi Diagrams in Finite Spaces

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:30235f69e554b830d1af785194f7b753
Prüfsumme: MD5:2f24b835500065ec45d892d82f4158b5

BALZER, Michael, Daniel HECK, 2008. Capacity-Constrained Voronoi Diagrams in Finite Spaces. Voronoi Diagrams in Science and Engineering. Kiev, Ukraine, 22. Sep 2008 - 28. Sep 2008. In: Proceedings of the 5 th Annual International Symposium on Voronoi Diagrams in Science and Engineering, 22 - 28 September, 2008, Kiev, Ukraine. Voronoi Diagrams in Science and Engineering. Kiev, Ukraine, 22. Sep 2008 - 28. Sep 2008

@inproceedings{Balzer2008Capac-5419, title={Capacity-Constrained Voronoi Diagrams in Finite Spaces}, year={2008}, 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 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5419"> <dc:creator>Heck, Daniel</dc:creator> <dcterms:title>Capacity-Constrained Voronoi Diagrams in Finite Spaces</dcterms:title> <dc:contributor>Balzer, Michael</dc:contributor> <dc:rights>deposit-license</dc:rights> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:14Z</dc:date> <dcterms:issued>2008</dcterms:issued> <dc:format>unknown</dc:format> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:14Z</dcterms:available> <dc:format>application/pdf</dc:format> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5419"/> <dc:language>deu</dc:language> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <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: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> <dc:contributor>Heck, Daniel</dc:contributor> <dc:creator>Balzer, Michael</dc:creator> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Capacity_Constrained_Voronoi_Diagrams_in_Finite_Spaces.pdf 121
Capacity_Constrained_Voronoi_Diagrams_in_Finite_Spaces.avi 11

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto