Division algorithms for Bernstein polynomials

Computer Aided Geometric Design

Volumn 25, Issue 9, 2008, Pages 850-865

  Busé, Laurent ^a   Goldman, Ron ^b  

^a INRIA   (France)

^b RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AMBER; BOOLEAN FUNCTIONS; POLYNOMIAL APPROXIMATION; SET THEORY;

BERNSTEIN BASES; BERNSTEIN POLYNOMIALS; COMPUTING; DIVISION ALGORITHMS; MONOMIAL BASES; NO CONVERSIONS; RING ISOMORPHISMS; UNIVARIATE;

POLYNOMIALS;

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

References (20)

1. Busé, L., Elkadi, M., Galligo, A., 2007. A computational study of ruled surfaces. J. Symbolic Comput. In press
2. Carnicer J.M., and Peña J.M. Shape preserving representations and optimality of the Bernstein basis. Adv. Comput. Math. 1 2 (1993) 173-196
3. Chen F. Reparametrization of a rational ruled surface using the μ-basis. Comput. Aided Geom. Design 20 1 (2003) 11-17
4. Chen F., and Sederberg T. A new implicit representation of a planar rational curve with high order singularity. Comput. Aided Geom. Design 19 2 (2002) 151-167
5. Chen F., and Wang W. The μ-basis of a planar rational curve-properties and computation. Graphical Models 64 6 (2002) 368-381
6. Chen F., and Wang W. Revisiting the μ-basis of a rational ruled surface. J. Symbolic Comput. 36 5 (2003) 699-716
7. Chen F., Zheng J., and Sederberg T.W. The mu-basis of a rational ruled surface. Comput. Aided Geom. Design 18 1 (2001) 61-72
8. Cox D., Little J., and O'Shea D. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Undergraduate Texts in Mathematics. second ed. (1997), Springer-Verlag, New York
9. Cox D., Little J., and O'Shea D. Using Algebraic Geometry. Graduate Texts in Mathematics vol. 185 (1998), Springer-Verlag, New York
10. Cox D.A., Sederberg T.W., and Chen F. The moving line ideal basis of planar rational curves. Comput. Aided Geom. Design 15 8 (1998) 803-827
11. Farouki R.T., and Rajan V.T. On the numerical condition of polynomials in Bernstein form. Comput. Aided Geom. Design 4 3 (1987) 191-216
12. Goldman R. Pyramid Algorithms: A Dynamic Programming Approach to Curves and Surfaces for Geometric Modeling (2002), Morgan Kaufmann Publishers, Academic Press, San Diego
13. Hilbert D. Ueber die Theorie der algebraischen Formen. Math. Ann. 36 4 (1890) 473-534
14. Lin Z. On syzygy modules for polynomial matrices. Linear Algebra Appl. 289 1-3 (1999) 73-86
15. Sederberg, T.W., Chen, F., 1995. Implicitization using moving curves and surfaces. In: SIGGRAPH'95, Computer Graphics, Annual Conference Series, pp. 301-308
16. Sederberg T.W., Goldman R., and Du H. Implicitizing rational curves by the method of moving algebraic curves. J. Symbolic Comput. 23 2-3 (1997) 153-175
17. Sederberg T.W., Saito T., Qi D.X., and Klimaszewski K.S. Curve implicitization using moving lines. Comput. Aided Geom. Design 11 6 (1994) 687-706
18. Song, N., Goldman, R., 2007. μ-bases for polynomial systems in one variable. Comput. Aided Geom. Design. doi:10.1016/j.cagd.2008.04.001
19. Song N., Chen F., and Goldman R. Axial moving lines and singularities of rational planar curves. Comput. Aided Geom. Design. 24 4 (2007) 200-209
20. Zheng J., and Sederberg T.W. A direct approach to computing the μ-basis of planar rational curves. J. Symbolic Comput. 31 5 (2001) 619-629