214 search results - page 1 / 43 » Computing the Closest Point to a Circle |
CCCG
2003
13 years 6 months ago
2003
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...
IVC
2006
13 years 4 months ago
2006
While the SoftAssign algorithm imposes a two-way constraint embedded into the deterministic annealing scheme and the EMICP algorithm imposes a one-way constraint, they represent t...
CAIP
1997
Springer
13 years 9 months ago
1997
Springer
Abstract—This work presents a method for the registration of threedimensional (3-D) shapes. The method is based on the iterative closest point (ICP) algorithm and improves it thr...
BMVC
1998
13 years 6 months ago
1998
In this paper, we discuss a method for representing and matching planar curves. The technique is based on using calculations from concentric circles to represent each curve by two...
ICPR
2002
IEEE
14 years 6 months ago
2002
IEEE
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension o...