94 search results - page 2 / 19 » Verifying spatial queries using Voronoi neighbors |
151
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
274
click to vote
ICDE
2009
IEEE
16 years 7 months ago
2009
IEEE
Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {...
156
click to vote
CCCG
2006
15 years 7 months ago
2006
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...
156
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we identify and solve a new type of spatial queries, called continuous visible nearest neighbor (CVNN) search. Given a data set P, an obstacle set O, and a query li...
325
click to vote
ICDE
2008
IEEE
17 years 5 months ago
2008
IEEE
In applications like location-based services, sensor monitoring and biological databases, the values of the database items are inherently uncertain in nature. An important query fo...