237 search results - page 3 / 48 » Methods for Achieving Fast Query Times in Point Location Dat... |
SIGMOD
2005
ACM
14 years 6 months ago
2005
ACM
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
CCCG
2008
13 years 7 months ago
2008
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
CVPR
2009
IEEE
15 years 1 months ago
2009
IEEE
Efficient view registration with respect to a given 3D reconstruction
has many applications like inside-out tracking
in indoor and outdoor environments, and geo-locating images
...
SWAT
2000
Springer
13 years 9 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...