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

Celý popis

Podrobná bibliografia

Vydané v:	Algorithmica Ročník 81; číslo 6; s. 2317 - 2345
Hlavní autori:	Bohler, Cecilia, Klein, Rolf, Liu, Chih-Hung
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.06.2019 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!