Hybrid Second-Order Iterative Algorithm for Orthogonal Projection onto a Parametric Surface

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.

[1]  Weiyin Ma,et al.  Computing the Hausdorff distance between two B-spline curves , 2010, Comput. Aided Des..

[2]  Kwang Hee Ko,et al.  Orthogonal projection of points in CAD/CAM applications: an overview , 2014, J. Comput. Des. Eng..

[3]  Jun-Hai Yong,et al.  Computing the minimum distance between a point and a NURBS curve , 2008, Comput. Aided Des..

[4]  Jun-Hai Yong,et al.  Computing the minimum distance between two Bézier curves , 2009 .

[5]  Ilijas Selimovic,et al.  Improved algorithms for the projection of points on NURBS curves and surfaces , 2006, Comput. Aided Geom. Des..

[6]  Hong Jiang,et al.  An efficient surface-surface intersection algorithm based on geometry characteristics , 2004, Comput. Graph..

[7]  Tom Lyche,et al.  Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics , 1980 .

[8]  Nicholas M. Patrikalakis,et al.  Shape Interrogation for Computer Aided Design and Manufacturing , 2002, Springer Berlin Heidelberg.

[9]  Jun-Hai Yong,et al.  Algorithm for orthogonal projection of parametric curves onto B-spline surfaces , 2011, Comput. Aided Des..

[10]  Franz-Erich Wolter,et al.  Surface Curve Design by Orthogonal Projection of Space Curves Onto Free-Form Surfaces , 1996 .

[11]  Gershon Elber,et al.  Efficient point-projection to freeform curves and surfaces , 2010, Comput. Aided Geom. Des..

[12]  Les A. Piegl,et al.  Parametrization for surface fitting in reverse engineering , 2001, Comput. Aided Des..

[13]  Wenping Wang,et al.  Control point adjustment for B-spline curve approximation , 2004, Comput. Aided Des..

[14]  Shi-Min Hu,et al.  A second order algorithm for orthogonal projection onto curves and surfaces , 2005, Comput. Aided Geom. Des..

[15]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Lei Yang,et al.  A torus patch approximation approach for point projection on surfaces , 2009, Comput. Aided Geom. Des..

[17]  Michael E. Mortenson,et al.  Geometric Modeling , 2008, Encyclopedia of GIS.

[18]  Joseph F. Traub,et al.  A class of globally convergent iteration functions for the solution of polynomial equations , 1966 .

[19]  L. Piegl,et al.  The NURBS Book , 1995, Monographs in Visual Communications.

[20]  YingLiang Ma,et al.  Point inversion and projection for NURBS curve and surface: Control polygon approach , 2003, Comput. Aided Geom. Des..

[21]  Elaine Cohen,et al.  Distance extrema for spline models using tangent cones , 2005, Graphics Interface.

[22]  Erich Hartmann.  On the curvature of curves and surfaces defined by normalforms , 1999, Comput. Aided Geom. Des..

[23]  Josef Hoschek,et al.  Fundamentals of computer aided geometric design , 1996 .

[24]  A. Melman.  Classroom Note: Geometry and Convergence of Euler's and Halley's Methods , 1997, SIAM Rev..

[25]  Ku-Jin Kim.  Minimum distance between a canal surface and a simple surface , 2003, Comput. Aided Des..

[26]  Johannes O. Royset,et al.  Algorithms with Adaptive Smoothing for Finite Minimax Problems , 2003 .

[27]  Nicholas M. Patrikalakis,et al.  Computation of stationary points of distance functions , 1993, Engineering with Computers.

[28]  Ramanathan Muthuganapathy,et al.  Footpoint distance as a measure of distance computation between curves and surfaces , 2014, Comput. Graph..

[29]  Hu Shi.  Computing the Parameters of Points on Nurbs Curves and Surfaces via Moving Affine Frame Method , 2000 .

[30]  Mingsheng Zhang,et al.  A geometric strategy for computing intersections of two spatial parametric curves , 2012, The Visual Computer.

[31]  Anis Limaiem,et al.  Geometric algorithms for the intersection of curves and surfaces , 1995, Comput. Graph..

[32]  Elaine Cohen,et al.  A framework for efficient minimum distance computations , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).

[33]  Les A. Piegl,et al.  Ten challenges in computer-aided design , 2005, Comput. Aided Des..

[34]  Jun-Hai Yong,et al.  Computing the minimum distance between a point and a clamped B-spline surface , 2009, Graph. Model..