A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams

Given a set of n sites in the plane, their order-k Voronoi diagram partitions the plane into regions such that all points within one region have the same k nearest sites. The order-k abstract Voronoi diagram offers a unifying framework that represents a wide range of concrete order-k Voronoi diagram...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computational geometry : theory and applications Jg. 59; S. 26 - 38
Hauptverfasser:	Bohler, Cecilia, Liu, Chih-Hung, Papadopoulou, Evanthia, Zavershynskyi, Maksym
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.12.2016
Schlagworte:	Abstract Voronoi diagram Divide and conquer Geometric randomized algorithm Higher-order Voronoi diagram k nearest neighbors Geometric randomized algorithm Higher-order Voronoi diagram k nearest neighbors Abstract Voronoi diagram Divide and conquer
ISSN:	0925-7721
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!