On the degree elevation of Bernstein polynomial representation (Q556280): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(9 intermediate revisions by 8 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.cam.2004.11.012 / rank | |||
Property / review text | |||
The author introduces new algorithms for degree elevation of Bernstein polynomial representations. Also, a very complete analysis and a discussion of the new and of most of the known algorithms of this kind are presented. In addition, based on the obtained results for the conditioning of degree evaluation matrices, the author also analyzes the accuracy of the new algorithms. Finally, I would like to mention that the introduction of the paper, although short, gives a nice description of the most important reasons that motivate the necessity of developing degree evaluation algorithms for Bernstein polynomial representations. | |||
Property / review text: The author introduces new algorithms for degree elevation of Bernstein polynomial representations. Also, a very complete analysis and a discussion of the new and of most of the known algorithms of this kind are presented. In addition, based on the obtained results for the conditioning of degree evaluation matrices, the author also analyzes the accuracy of the new algorithms. Finally, I would like to mention that the introduction of the paper, although short, gives a nice description of the most important reasons that motivate the necessity of developing degree evaluation algorithms for Bernstein polynomial representations. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65D17 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 2175290 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
computer aided geometric design | |||
Property / zbMATH Keywords: computer aided geometric design / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
degree elevation algorithms | |||
Property / zbMATH Keywords: degree elevation algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Bernstein polynomials | |||
Property / zbMATH Keywords: Bernstein polynomials / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
conditioning | |||
Property / zbMATH Keywords: conditioning / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Juan Rafael Sendra / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: mctoolbox / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.cam.2004.11.012 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1985815113 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4732025 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Robust arithmetic for multivariate Bernstein-form polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A survey of curve and surface methods in CAGD / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rates of convergence of control polygons / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The numerical problem of using Bézier curves and surfaces in the power basis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalizing rational degree elevation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3832999 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4026178 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the numerical condition of polynomials in Bernstein form / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for polynomials in Bernstein form / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Numerical Condition of Bernstein-Bezier Subdivision Processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the stability of transformations between power and Bernstein polynomial forms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Legendre-Bernstein basis transformations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4879983 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A blossoming approach to accuracy of the degree elevation process / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Asymptotic convergence of degree-raising / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interactive Interpolation and Approximation by Bezier Polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5650405 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4864704 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3993269 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Modification of Bézier curves and surfaces by degree-elevation technique / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Comparison of interval methods for plotting algebraic curves / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the smooth convergence of subdivision and degree elevation for Bézier curves / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Software-engineering approach to degree elevation of \(B\)-spline curves / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergence of subdivision and degree elevation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distance for degree raising and reduction of triangular Bézier surfaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A unified approach for degree reduction of polynomials in the Bernstein basis. I: Real polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arbitrarily high degree elevation of Bézier representations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3994898 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.CAM.2004.11.012 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 21:27, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the degree elevation of Bernstein polynomial representation |
scientific article |
Statements
On the degree elevation of Bernstein polynomial representation (English)
0 references
13 June 2005
0 references
The author introduces new algorithms for degree elevation of Bernstein polynomial representations. Also, a very complete analysis and a discussion of the new and of most of the known algorithms of this kind are presented. In addition, based on the obtained results for the conditioning of degree evaluation matrices, the author also analyzes the accuracy of the new algorithms. Finally, I would like to mention that the introduction of the paper, although short, gives a nice description of the most important reasons that motivate the necessity of developing degree evaluation algorithms for Bernstein polynomial representations.
0 references
computer aided geometric design
0 references
degree elevation algorithms
0 references
Bernstein polynomials
0 references
conditioning
0 references
0 references