Hybrid second-order iterative algorithm for orthogonal projection onto a parametric surface
Summary: To compute the minimum distance between a point and a parametric surface, three well-known first-order algorithms have been proposed by \textit{E. Hartmann} [Comput. Aided Geom. Des. 16, No. 5, 355--376 (1999; Zbl 0916.68159)], \textit{J. Hoschek} and \textit{D. Lasser} [Fundamentals of computer aided geometric design. Translated from the German by Larry L. Schumaker. Wellesley, MA: A. K. Peters (1993; Zbl 0788.68002)] and \textit{S.-M. Hu} et al. [``Computing the parameters of points on NURBS curves and surfaces via moving affine frame method, J. Softw. 11, No. 1, 49--53 (2000)] (hereafter, the First-Order method). In this paper, we prove the method's first-order convergence and its independence of the initial value. We also give some numerical examples to illustrate its faster convergence than the existing methods. For some special cases where the First-Order method does not converge, we combine it with Newton's second-order iterative method to present the hybrid second-order algorithm. Our method essentially exploits hybrid iteration, thus it performs very well with a second-order convergence, it is faster than the existing methods and it is independent of the initial value. Some numerical examples confirm our conclusion.
- A second-order algorithm for curve orthogonal projection onto parametric surface
- A second order algorithm for orthogonal projection onto curves and surfaces
- Hybrid second order method for orthogonal projection onto parametric curve in \(n\)-dimensional Euclidean space
- A second order geometric method for ray/parametric surface intersection
- A refinement of an iterative orthogonal projection method
- Convergence analysis on a second order algorithm for orthogonal projection onto curves
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
- An orthogonal projection algorithm for point onto implicit curves
- scientific article; zbMATH DE number 2015331
- A Class of Globally Convergent Iteration Functions for the Solution of Polynomial Equations
- A second order algorithm for orthogonal projection onto curves and surfaces
- A torus patch approximation approach for point projection on surfaces
- Algorithms with adaptive smoothing for finite minimax problems
- Classroom Note:Geometry and Convergence of Euler's and Halley's Methods
- Computing the minimum distance between two Bézier curves
- scientific article; zbMATH DE number 42384 (Why is no real title available?)
- scientific article; zbMATH DE number 491264 (Why is no real title available?)
- Improved algorithms for the projection of points on NURBS curves and surfaces
- Minimum distance between a canal surface and a simple surface
- On the curvature of curves and surfaces defined by normalforms
- Point inversion and projection for nurbs curve and surface: control polygon approach
- Shape Interrogation for Computer Aided Design and Manufacturing
- A geometric orthogonal projection strategy for computing the minimum distance between a point and a spatial parametric curve
- Convergence analysis on a second order algorithm for orthogonal projection onto curves
- Hybrid second order method for orthogonal projection onto parametric curve in \(n\)-dimensional Euclidean space
- A torus patch approximation approach for point projection on surfaces
This page was built for publication: Hybrid second-order iterative algorithm for orthogonal projection onto a parametric surface
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333544)
