Matrix animation and polar decomposition
Proceedings of the conference on Graphics interface '92
Computational Line Geometry
Approximation with Active B-Spline Curves and Surfaces
PG '02 Proceedings of the 10th Pacific Conference on Computer Graphics and Applications
Minimizing the Distortion of Affine Spline Motions
PG '01 Proceedings of the 9th Pacific Conference on Computer Graphics and Applications
Convergence and C1 analysis of subdivision schemes on manifolds by proximity
Computer Aided Geometric Design - Special issue: Geometric modelling and differential geometry
Convergence and C1 analysis of subdivision schemes on manifolds by proximity
Computer Aided Geometric Design - Special issue: Geometric modelling and differential geometry
A revisit to least squares orthogonal distance fitting of parametric curves and surfaces
GMP'08 Proceedings of the 5th international conference on Advances in geometric modeling and processing
| Hi-index | 0.00 |
We consider the ICP (iterative closest point) algorithm, which may in general be used for moving 'active' elements such as curves and surfaces towards geometric objects whose distance field is computable. We show how it may be accelerated, and how it can be applied to the design of near-Euclidean near-contact spline motions. One particular application of this concept is the modeling of milling tool paths in five-axis milling. The method involves computing the distance from and footpoints in both the Euclidean motion group and the configuration space of surface-surface contact.