Sciweavers

Share
CCCG
2006

(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram

11 years 2 months ago
(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
For a given point set in Euclidean space we consider the problem of finding (approximate) nearest neighbors of a query point but restricting only to points that lie within a fixed cone with apex at the query point. We investigate the structure of the Voronoi diagram induced by this notion of proximity and present approximate and exact data structures for answering cone-restricted nearest neighbor queries. In particular we develop an approximate Voronoi diagram of size O((n/d)log(1/)) that can be used to answer cone-restricted nearest neighbor queries in O(log(n/)) time.
Stefan Funke, Theocharis Malamatos, Domagoj Matije
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2006
Where CCCG
Authors Stefan Funke, Theocharis Malamatos, Domagoj Matijevic, Nicola Wolpert
Comments (0)
books