Division algorithms for Bernstein polynomials

Three division algorithms are presented for univariate Bernstein polynomials: an algorithm for finding the quotient and remainder of two univariate polynomials, an algorithm for calculating the GCD of an arbitrary collection of univariate polynomials, and an algorithm for computing a

• Type: Journal
• Year: 2008
• Where: CAGD
• Authors: Laurent Busé, Ron Goldman
• Keywords: Algorithms, Bernstein Polynomials, CAGD 2008, Univariate Polynomials