On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis
From MaRDI portal
Publication:1955532
DOI10.1007/s10444-011-9256-6zbMath1279.65021OpenAlexW2011422470MaRDI QIDQ1955532
Juan Manuel Peña, Jorge Delgado
Publication date: 14 June 2013
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10444-011-9256-6
finite elementsgeometric modelingBernstein basisoptimal stabilityrational triangular Bézier surfacesrational triangular de Casteljau algorithm
Approximation by rational functions (41A20) Roundoff error (65G50) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items
On the accuracy of de Casteljau-type algorithms and Bernstein representations, An evaluation algorithm for \(q\)-Bézier triangular patches formed by convex combinations, Accurate Computations and Applications of Some Classes of Matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Are rational Bézier surfaces monotonicity preserving?
- Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form
- Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form
- Efficient evaluation of multivariate polynomials
- On the numerical condition of polynomials in Bernstein form
- A rational finite element basis
- Optimally stable multivariate bases
- On the optimal stability of bases of univariate functions
- A note on the optimal stability of bases of univariate functions
- The evaluation of the zeros of ill-conditioned polynomials. I, II
- Running Relative Error for the Evaluation of Polynomials
- A Corner Cutting Algorithm for Evaluating Rational Bézier Surfaces and the Optimal Stability of the Basis
- Monotonicity preservation on triangles
- On the Multivariate Horner Scheme
- Accuracy and Stability of Numerical Algorithms
- On the multivariate Horner scheme. II: Running error analysis
