Reverse nearest neighbor queries in fixed dimension

Details Reverse nearest neighbor queries in fixed dimension Reverse nearest neighbor queries in fixed dimension

2009-05-27

arxiv.org/abs/0905.4441v3

Computer Science

Computational Geometry

7 pages, 3 figures; typos corrected; more background material on compressed quadtrees

Scientific paper

Reverse nearest neighbor queries are defined as follows: Given an input point-set P, and a query point q, find all the points p in P whose nearest point in P U {q} \ {p} is q. We give a data structure to answer reverse nearest neighbor queries in fixed-dimensional Euclidean space. Our data structure uses O(n) space, its preprocessing time is O(n log n), and its query time is O(log n).

Affiliated with

Also associated with

No associations

Rating

Reverse nearest neighbor queries in fixed dimension does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reverse nearest neighbor queries in fixed dimension, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reverse nearest neighbor queries in fixed dimension will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-527836