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...

Celý popis

Podrobná bibliografia

Vydané v:	Computational geometry : theory and applications Ročník 59; s. 26 - 38
Hlavní autori:	Bohler, Cecilia, Liu, Chih-Hung, Papadopoulou, Evanthia, Zavershynskyi, Maksym
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.12.2016
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!