138 search results - page 13 / 28 » Efficient Expected-Case Algorithms for Planar Point Location |
SIGMOD
2005
ACM
14 years 8 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...
ICCV
2001
IEEE
14 years 9 months ago
2001
IEEE
A linear method for computing a projective reconstruction from a large number of images is presented and then evaluated. The method uses planar homographies between views to linea...
SIAMCOMP
2000
13 years 7 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
ALGORITHMICA
2007
13 years 8 months ago
2007
d abstract) Lars Arge1 , Darren Erik Vengroff2 , and Jeffrey Scott Vitter3 1 BRICS† , Department of Computer Science, University of Aarhus, Aarhus, Denmark 2 Department of Comp...
3DIM
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper presents a new system for acquiring complete 3D surface models using a single structured light projector, a pair of planar mirrors, and one or more synchronized cameras...