13 search results - page 2 / 3 » An Efficient Algorithm for 2D Euclidean 2-Center with Outlie... |
IJCGA
2010
13 years 2 months ago
2010
For a set T of n points in a metric space (X, d), a point y X is dominated by a point x X if d(x, t) d(y, t) for all t T and there exists t T such that d(x, t ) < d(y, t )....
STOC
2002
ACM
14 years 5 months ago
2002
ACM
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
3DIM
2003
IEEE
13 years 9 months ago
2003
IEEE
In this paper we present an efficient and general approach to computing and integrating 3D distance fields directly from multiple range images. We compute normal and confidence va...
ICCV
2005
IEEE
14 years 7 months ago
2005
IEEE
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...