13 search results - page 1 / 3 » An Efficient Algorithm for 2D Euclidean 2-Center with Outlie... |
ESA
2008
Springer
14 years 23 days ago
2008
Springer
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...
IWVF
2001
Springer
14 years 3 months ago
2001
Springer
ÐA voxel-based method for flattening a surface in 3D space into 2D while best preserving distances is presented. Triangulation or polyhedral approximation of the voxel data are no...
EUSFLAT
2009
13 years 8 months ago
2009
Fuzzy C-Means (FCM) and hard clustering are the most common tools for data partitioning. However, the presence of noisy observations in the data may cause generation of completely ...
ECCV
2010
Springer
14 years 3 days ago
2010
Springer
Abstract. Automatic detection of symmetries, regularity, and repetitive structures in 3D geometry is a fundamental problem in shape analysis and pattern recognition with applicatio...
EMMCVPR
2009
Springer
13 years 8 months ago
2009
Springer
Determining Euclidean transformations for the robust registration of noisy unstructured point sets is a key problem of model-based computer vision and numerous industrial applicati...