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

Full description

Bibliographic Details

Published in:	Computational geometry : theory and applications Vol. 59; pp. 26 - 38
Main Authors:	Bohler, Cecilia, Liu, Chih-Hung, Papadopoulou, Evanthia, Zavershynskyi, Maksym
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.12.2016
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!