To compute the minimum distance between a point and a parametric surface, three well-known first-order algorithms have been proposed by Hartmann (1999), Hoschek, et al. (1993) and Hu, et al. (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.
Orthogonal projection a point onto a parametric curve, three classic first order algorithms have been presented by Hartmann (1999), Hoschek, et al. (1993) and Hu, et al. (2000) (hereafter, H-H-H method). In this research, we give a proof of the approach’s first order convergence and its non-dependence on the initial value. For some special cases of divergence for the H-H-H method, we combine it with Newton’s second order method (hereafter, Newton’s method) to create the hybrid second order method for orthogonal projection onto parametric curve in an n-dimensional Euclidean space (hereafter, our method). Our method essentially utilizes hybrid iteration, so it converges faster than current methods with a second order convergence and remains independent from the initial value. We provide some numerical examples to confirm robustness and high efficiency of the method.
A new orthogonal projection method for computing the minimum distance between a point and a spatial parametric curve is presented. It consists of a geometric iteration which converges faster than the existing Newton’s method, and it is insensitive to the choice of initial values. We prove that projecting a point onto a spatial parametric curve under the method is globally second-order convergence.
Regarding the point projection and inversion problem, a classical algorithm for orthogonal projection onto curves and surfaces has been presented by Hu and Wallner (2005). The objective of this paper is to give a convergence analysis of the projection algorithm. On the point projection problem, we give a formal proof that it is second order convergent and independent of the initial value to project a point onto a planar parameter curve. Meantime, for the point inversion problem, we then give a formal proof that it is third order convergent and independent of the initial value.
We present an accurate method to compute the minimum distance between a point and an elliptical torus, which is called the orthogonal projection problem. The basic idea is to transform a geometric problem into finding the unique real solution of a quartic equation, which is fit for orthogonal projection of a point onto the elliptical torus. Firstly, we discuss the corresponding orthogonal projection of a point onto the elliptical torus for test points at six different spatial positions. Secondly, we discuss the same problem for test points on three special positions, e.g., points on the z-axis, the long axis and the minor axis, respectively.