167 search results - page 1 / 34 » Constraints for closest point finding |
PRL
2008
13 years 4 months ago
2008
The traditional closest point criterion has been widely used for 3D free form shape matching, object recognition, internet search, computer graphics and medical imaging. However, ...
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...
IPL
2002
13 years 4 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
ICPR
2008
IEEE
14 years 6 months ago
2008
IEEE
A framework for mapping a polar-like coordinate system to a non-rigid shape is presented. Using a graph pyramid, a binary shape is decomposed into connected parts, based on its st...
AUTOMATICA
2008
13 years 5 months ago
2008
Periodic smoothing splines appear for example as generators of closed, planar curves, and in this paper they are constructed using a controlled two point boundary value problem in...