点到平面参数曲线距离的最小算法.pdf

Global Hybrid Method for Computing the Minimum Distance Between a Point and a Plane Parametric Curve Zhinan Wu School of Mathematics and Computer Science , Yichun University, Yichun, People Republic of China zhi_nan_7@163.com Abstrak – 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 Key Words – point projection, newton’s method, global convergence, parametric curve 1 Introduction In this paper, we discuss how to compute the minimum distance between a point and a spatial parametric curve and to return the nearest point on the curve as well as its corresponding parameter, which is also called the point projection problem (the point inversion problem) of a spatial parametric curve. It is very interesting for this problem due to its importance in geometric modeling, computer graphics and computer vision (Ma Hewitt, 2003). Both projection and inversion are essential for interactively selecting curves (Ma Hewitt, 2003; Yang, et. al., 2004 ), for the curve fitting problem (Ma Hewitt, 2003; Yang, et. al., 2004), for the reconstructing curves problem (Johnson Cohen, 1998; Piegl Tiller, 2001; Pegna Wolter, 1996). It is also a key issue in the ICP (iterative close f