On the degree elevation of Bernstein polynomial representation

  • Authors:
  • Bolesław Szafnicki

  • Affiliations:
  • Dr. Szafnicki, CAD Applications, Scharrkoppelweg 22, D-38557 Osloss, Germany

  • Venue:
  • Journal of Computational and Applied Mathematics
  • Year:
  • 2005

Quantified Score

Hi-index 7.30

Visualization

Abstract

The polynomials determined in the Bernstein (Bezier) basis enjoy considerable popularity in computer-aided design (CAD) applications. The common situation in these applications is, that polynomials given in the basis of degree n have to be represented in the basis of higher degree. The corresponding transformation algorithms are called algorithms for degree elevation of Bernstein polynomial representations. These algorithms are only then of practical importance if they do not require the ill-conditioned conversion between the Bernstein and the power basis. We discuss all the algorithms of this kind known in the literature and compare them to the new ones we establish. Some among the latter are better conditioned and not more expensive than the currently used ones. All these algorithms can be applied componentwise to vector-valued polynomial Bezier representations of curves or surfaces.