Global Hybrid Method for Computing the Minimum Distance Between a Point and a Plane Parametric Curve

Global convergent hybrid method is presented for computing the minimum distance between a point and a plane parametric curve. First, it uses a first order geometric iteration method. If iterative parametric value satisfied local Newton convergence condition and convergence in appropriate area, then turning to Newton iteration method. This hybrid method’s sensitivity to the choice of initial values is nonexistence. Experimental results show that the algorithms under consideration are robust and efficient.