2601 search results - page 105 / 521 » A Point in Many Triangles |
SODA
1993
ACM
13 years 11 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
SDM
2003
SIAM
13 years 11 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
CVPR
2005
IEEE
15 years 6 days ago
2005
IEEE
We present a new method for generating large numbers of accurate point correspondences between two wide baseline images. This is important for structure-from-motion algorithms, wh...
ECCV
2004
Springer
15 years 2 days ago
2004
Springer
Local feature approaches to vision geometry and object recognition are based on selecting and matching sparse sets of visually salient image points, known as `keypoints' or `p...
ICML
2004
IEEE
14 years 11 months ago
2004
IEEE
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...