179 search results - page 10 / 36 » On Approximating the Average Distance Between Points |
IMR
2003
Springer
14 years 1 months ago
2003
Springer
Generation of surface meshes remains an active research problem despite the many publications addressing this topic. The main issues which must be treated by a good remeshing algo...
CCCG
2006
13 years 10 months ago
2006
Given two sets A and B of n points each in R2 , we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. W...
ISBI
2008
IEEE
14 years 9 months ago
2008
IEEE
We present a method to automatically quantify the local asymmetries of bilateral structures in point clouds. The method relies on the robust computation of the approximate symmetr...
TKDE
2008
13 years 8 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
JCSS
2002
13 years 8 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...