A geometric orthogonal projection strategy for computing the minimum distance between a point and a spatial parametric curve
DOI10.3390/a9010015zbMath1461.65021OpenAlexW2271688175MaRDI QIDQ1736768
Linke Hou, Qiao Xin, Zhinan Wu, Lin Wang, Chunguang Yue, Xiaowu Li
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a9010015
convergence analysisglobal convergenceNewton's methodosculating circlepoint projectionosculating sphere
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Curves in Euclidean and related spaces (53A04)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- On the approximation of derivatives using divided difference operators preserving the local convergence order of iterative methods
- Algorithms with adaptive smoothing for finite minimax problems
- Bézier clipping is quadratically convergent
- Sixteenth-order method for nonlinear equations
- On the curvature of curves and surfaces defined by normalforms
- Fifth-order iterative method for solving multiple roots of the highest multiplicity of nonlinear equation
- Point inversion and projection for nurbs curve and surface: control polygon approach
- Improved algorithms for the projection of points on NURBS curves and surfaces
- A second order algorithm for orthogonal projection onto curves and surfaces
- Shape Interrogation for Computer Aided Design and Manufacturing
- Classroom Note:Geometry and Convergence of Euler's and Halley's Methods
- A Class of Globally Convergent Iteration Functions for the Solution of Polynomial Equations
- A modified Newton-Jarratt's composition
This page was built for publication: A geometric orthogonal projection strategy for computing the minimum distance between a point and a spatial parametric curve
