A geometric strategy for computing intersections of two spatial parametric curves

An effective geometrically motivated intersection algorithm for two spatial parametric curves is presented. Examples are shown to illustrate the efficiency and robustness of the new method.

[1]  Christoph M. Hoffmann,et al.  Geometric and Solid Modeling , 1989 .

[2]  Dinesh Manocha,et al.  Algorithms for intersecting parametric and algebraic curves I: simple intersections , 1994, TOGS.

[3]  Liao Xiangke,et al.  A new fourth-order iterative method for finding multiple roots of nonlinear equations , 2009 .

[4]  Richard F. Riesenfeld,et al.  A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Alicia Cordero,et al.  Variants of Newton's Method using fifth-order quadrature formulas , 2007, Appl. Math. Comput..

[6]  S. Mudur,et al.  A new class of algorithms for the processing of parametric curves , 1983 .

[7]  Xiuzi Ye,et al.  Robust interval algorithm for surface intersections , 1997, Comput. Aided Des..

[8]  Nicholas M. Patrikalakis,et al.  Robust interval algorithm for curve intersections , 1996, Comput. Aided Des..

[9]  Christoph M. Hoffmann,et al.  Geometric and Solid Modeling: An Introduction , 1989 .

[10]  Michael Kallay.  A geometric Newton-Raphson strategy , 2001, Comput. Aided Geom. Des..

[11]  Muhammad Aslam Noor,et al.  Some iterative methods for solving a system of nonlinear equations , 2009, Comput. Math. Appl..

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

[13]  Christian Schulz.  Bézier clipping is quadratically convergent , 2009, Comput. Aided Geom. Des..

[14]  Oliver Günther,et al.  Minimum K-Partitioning of Rectilinear Polygons , 1990, J. Symb. Comput..

[15]  Dinesh Manocha,et al.  Algorithms for intersecting parametric and algebraic curves , 1992 .

[16]  James T. Kajiya,et al.  Ray tracing parametric patches , 1982, SIGGRAPH.

[17]  Tomoyuki Nishita,et al.  Curve intersection using Bézier clipping , 1990, Comput. Aided Des..

[18]  Jinwen Ma,et al.  Sixteenth-order method for nonlinear equations , 2010, Appl. Math. Comput..

[19]  Rida T. Farouki,et al.  Singular Points of Algebraic Curves , 1990, J. Symb. Comput..

[20]  T. Sederberg.  Algorithm for algebraic curve intersection , 1989 .

[21]  George E. Collins,et al.  An efficient algorithm for infallible polynomial complex root isolation , 1992, ISSAC '92.

[22]  T. Sederberg.  Implicit and parametric curves and surfaces for computer aided geometric design , 1983 .

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

[24]  Bert Jüttler,et al.  Computing roots of polynomials by quadratic clipping , 2007, Comput. Aided Geom. Des..

[25]  Jinwen Ma,et al.  Fifth-order iterative method for finding multiple roots of nonlinear equations , 2011, Numerical Algorithms.

[26]  Christian Schulz,et al.  Computing intersections of planar spline curves using knot insertion , 2009, Comput. Aided Geom. Des..

[27]  T. Sederberg,et al.  Comparison of three curve intersection algorithms , 1986 .

[28]  Mlynská dolina.  BÉZIER CURVES INTERSECTION USING MONGE PROJECTION , 2007 .

[29]  James Hardy Wilkinson,et al.  The evaluation of the zeros of ill-conditioned polynomials. Part I , 1959, Numerische Mathematik.

[30]  Thomas W. Sederberg,et al.  Fat arcs: A bounding region with cubic convergence , 1989, Comput. Aided Geom. Des..

[31]  Gershon Elber,et al.  Hidden curve removal for free form surfaces , 1990, SIGGRAPH.