Computing roots of polynomials by quadratic clipping

Computer Aided Geometric Design

Volumn 24, Issue 3, 2007, Pages 125-141

  Bartoň, Michael ^a   Jüttler, Bert ^b  

^a JOHANN RADON INSTITUTE FOR COMPUTATIONAL AND APPLIED MATHEMATICS   (Austria)

^b JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

B zier clipping; Polynomial; Root finding

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER AIDED DESIGN; CONVERGENCE OF NUMERICAL METHODS; GEOMETRY; GRAPH THEORY; LINEAR PROGRAMMING;

BÉZIER CLIPPING; CONVERGENCE RATE; QUADRATIC CLIPPING; ROOT FINDING;

POLYNOMIALS;

EID: 33847382410     PISSN: 01678396     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cagd.2007.01.003     Document Type: Article

References (25)

1. 2-norm equals best weighted Euclidean approximation of Bézier coefficients. Computer Aided Geometric Design 21 (2004) 181-191
2. Ciesielski Z. The basis of B-splines in the space of algebraic polynomials. Ukrainian Math. J. 38 (1987) 311-315
3. Eck M. Degree reduction of Bézier curves. Computer Aided Geometric Design 10 (1992) 237-251
4. Efremov A., Havran V., and Seidel H.-P. Robust and numerically stable Bézier clipping method for ray tracing NURBS surfaces. Proc. 21st Spring Conference on Computer Graphics (2005), ACM Press, New York 127-135
5. Elber, G., Kim, M.-S., 2001. Geometric constraint solver using multivariate rational spline functions. In: The Sixth ACM/IEEE Symposium on Solid Modeling and Applications, Ann Arbor, MI, pp. 1-10
6. Farouki R.T., and Goodman T.N.T. On the optimal stability of the Bernstein basis. Math. Comp. 65 (1996) 1553-1566
7. Gatellier G., Labrouzy A., Mourrain B., and Técourt J. Computing the topology of three-dimensional algebraic curves. In: Dokken T., and Jüttler B. (Eds). Computational Methods for Algebraic Spline Surfaces (2003), Springer, Berlin 27-43
8. Gautschi W. Numerical Analysis (1997), Birkhäuser, Boston, MA
9. Gonzalez-Vega L., and Necula I. Efficient topology determination of implicitly defined algebraic plane curves. Computer Aided Geometric Design 19 (2002) 719-743
10. Hoschek J., and Lasser D. Fundamentals of Computer Aided Geometric Design (1993), AK Peters, Wellesley, MA
11. Jüttler B. The dual basis functions of the Bernstein polynomials. Adv. Comput. Math. 8 (1998) 345-352
12. Kim M.-S., Elber G., and Seong J.-K. Geometric computations in parameter space. Proc. 21st Spring Conference on Computer Graphics (2005), ACM, New York 27-32
13. Lee K. Principles of CAD/CAM/CAE Systems (1999), Prentice-Hall
14. Li T. Numerical solution of polynomial systems by homotopy continuation methods. In: Cucker F. (Ed). Special Volume: Foundations of Computational Mathematics. Handbook of Numerical Analysis vol. XI (2003), North-Holland, Amsterdam 209-304
15. 2-norm equals best Euclidean approximation of Bézier coefficients. Computer Aided Geometric Design 16 (1999) 607-612
16. McNamee J.M. Bibliographies on roots of polynomials. J. Comp. Appl. Math. 47, 391-394; 78, 1-1; 110, 305-306; 142, 433-434, available at. http://www1.elsevier.com/homepage/sac/cam/mcnamee/
17. Mourrain B., and Pavone J.-P. Subdivision methods for solving polynomial equations, Technical Report, no. 5658, INRIA Sophia Antipolis. http://www.inria.fr/rrrt/rr-5658.html
18. Nishita T., Sederberg T.W., and Kakimoto M. Ray tracing trimmed rational surface patches (1990), Siggraph Proceedings, ACM 337-345
19. Nishita T., and Sederberg T.W. Curve intersection using Bézier clipping. Computer-Aided Design 22 9 (1990) 538-549
20. Patrikalakis N.M., and Maekawa T. Intersection problems. In: Farin G., Hoschek J., and Kim M.-S. (Eds). Handbook of Computer Aided Geometric Design (2002), Elsevier, Amsterdam 623-649 (Chapter 25)
21. Patrikalakis N.M., and Maekawa T. Shape Interrogation for Computer Aided Design and Manufacturing (2002), Springer, Berlin
22. Sherbrooke E.C., and Patrikalakis N.M. Computation of the solutions of nonlinear polynomial systems. Computer Aided Geometric Design 10 (1993) 379-405
23. Sommese A.J., and Wampler C.W. The Numerical Solution of Systems of Polynomials Arising in Engineering and Science (2005), World Scientific, Singapore
24. Sunwoo H. Matrix representation for multi-degree reduction of Bézier curves. Computer Aided Geometric Design 22 (2005) 261-273
25. Wang H., Kearney J., and Atkinson K. Robust and efficient computation of the closest point on a spline curve. In: Lyche T., et al. (Ed). Curve and Surface Design. Saint Malo 2002 (2003), Nashboro Press, Brentwood 397-405