A planar quadratic clipping method for computing a root of a polynomial in an interval

This paper presents a new quadratic clipping method for computing a root of a polynomial f(t) of degree n within an interval. Different from the traditional one in R 1 space, it derives three quadratic curves in R 2 space for approximating ( t , f ( t ) ) instead, which leads to a higher approximation order. Two bounding polynomials are then computed in O ( n 2 ) for bounding the roots of f(t) within the interval. The new clipping method achieves a convergence rate of 4 for a single root, compared with that of 3 from traditional method using quadratic polynomial approximation in R 1 space. When f(t) is convex within the interval, the two bounding polynomials are able to be directly constructed without error estimation, which leads to computational complexity O(n). Numerical examples show the approximation effect and efficiency of the new method. The method is particularly useful for the fly computation in many geometry processing and graphics rendering applications. Graphical abstractDisplay Omitted HighlightsA planar quadratic clipping method is presented by using R 2 space instead.Achieve a convergence rate of 4 by using quadratic polynomials.Obtain a linear computation complexity O(n) instead of O ( n 2 ) for a convex case.In principle, the idea can be directly extended to the planar cubic clipping method.

[1]  Wenping Wang,et al.  Continuous Collision Detection for Two Moving Elliptic Disks , 2006, IEEE Transactions on Robotics.

[2]  Ligang Liu,et al.  Fast approach for computing roots of polynomials using cubic clipping , 2009, Comput. Aided Geom. Des..

[3]  Hans-Peter Seidel,et al.  Robust and numerically stable Bézier clipping method for ray tracing NURBS surfaces , 2005, SCCG '05.

[4]  P. McAree,et al.  Using Sturm sequences to bracket real roots of polynomial equations , 1990 .

[5]  Alkiviadis G. Akritas,et al.  Polynomial real root isolation using Descarte's rule of signs , 1976, SYMSAC '76.

[6]  P. Davis.  Interpolation and approximation , 1965 .

[7]  Nicholas M. Patrikalakis,et al.  Surface-to-surface intersections , 1993, IEEE Computer Graphics and Applications.

[8]  P. Borwein,et al.  Polynomials and Polynomial Inequalities , 1995 .

[9]  Bert Jüttler,et al.  The dual basis functions for the Bernstein polynomials , 1998, Adv. Comput. Math..

[10]  Gasper Jaklic,et al.  On geometric interpolation by planar parametric polynomial curves , 2007, Math. Comput..

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

[12]  Michael S. Floater.  High order approximation of rational curves by polynomial curves , 2006, Comput. Aided Geom. Des..

[13]  Ming C. Lin,et al.  Collision Detection between Geometric Models: A Survey , 1998 .

[14]  Gershon Elber,et al.  Geometric constraint solver using multivariate rational spline functions , 2001, SMA '01.

[16]  J. McNamee.  A bibliography on roots of polynomials , 1993 .

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

[18]  Nicholas M. Patrikalakis,et al.  Solving nonlinear polynomial systems in the barycentric Bernstein basis , 2008, The Visual Computer.

[19]  Martin Reimers,et al.  An unconditionally convergent method for computing zeros of splines and polynomials , 2007, Math. Comput..

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

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

[22]  Leonie Moench,et al.  Graphics Gems I , 2016 .

[23]  Tomoyuki Nishita,et al.  Ray tracing trimmed rational surface patches , 1990, SIGGRAPH.

[24]  P. Zimmermann,et al.  Efficient isolation of polynomial's real roots , 2004 .

[25]  J. McNamee.  A 2002 update of the supplementary bibliography on roots of polynomials , 2002 .

[26]  H. Keller,et al.  Analysis of Numerical Methods , 1967 .