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...
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...
Jonathan Derryberry, Don Sheehy, Maverick Woo, Dan...
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...
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Mahesh...
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
...
Arnold Irschara (Graz University of Technology), C...
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...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...