An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams

Given a set of n sites in the plane, the order- k Voronoi diagram is a planar subdivision such that all points in a region share the same k nearest sites. The order- k Voronoi diagram arises for the k -nearest-neighbor problem, and there has been a lot of work for point sites in the Euclidean metric...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 81; H. 6; S. 2317 - 2345
Hauptverfasser:	Bohler, Cecilia, Klein, Rolf, Liu, Chih-Hung
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.06.2019 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Axioms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Randomization Theory of Computation Voronoi graphs Order Computational geometry Voronoi diagrams Randomized geometric algorithms Abstract Voronoi diagrams
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!