Abstract
Based on the properties of orthogonal polynomials, we derive an explicit constrained degree reduction criterion for Bernstein-Bézier polynomials in L2 -norm. The criterion can be used to determine whether a further degree reduction can be applied to the polynomial in advance with a given tolerance ε. An efficient algorithm is also presented for obtaining the best Bernstein-Bézier polynomial after degree reduction. With the proposed algorithm, one can avoid the blind procedure for degree reduction and terminate the procedure in advance when the estimated error is larger than the given tolerance.
| Original language | English |
|---|---|
| Pages (from-to) | 181-190 |
| Journal | Computer-Aided Design and Applications |
| Volume | 4 |
| Issue number | 1-6 |
| DOIs | |
| Publication status | Published - 2007 |
Research Keywords
- Bernstein-bézier polynomial
- Degree reduction
- Error estimate
- Jacobi polynomial
Fingerprint
Dive into the research topics of 'Best multi-degree reduction of bernstein polynomial in L2 -norm based on an explicit termination criterion'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver