Error analysis of corner cutting algorithms
From MaRDI portal
Recommendations
Cited in
(20)- Convergence analysis of corner cutting algorithms refining nets of functions
- Compensated de Casteljau algorithm in \(K\) times the working precision
- A shape preserving corner cutting algorithm with an enhanced accuracy
- Corner cutting evaluation algorithms for general rational curves
- On the generalized Ball bases
- Evaluation of the derivative of a polynomial in Bernstein form
- Corner cutting systems
- Accurate computations and applications of some classes of matrices
- Algorithm 960
- Shape preserving alternatives to the rational Bézier model
- On the accuracy of de Casteljau-type algorithms and Bernstein representations
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- An evaluation algorithm for q-Bézier triangular patches formed by convex combinations
- Positivity, accuracy, optimality and applications
- Recent advances on accuracy, stability and optimality of B-bases
- Accurate determinant computation of Cauchy-polynomial matrices
- Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form
- Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form
- Error analysis of efficient evaluation algorithms for tensor product surfaces
- Roundoff errors for polynomial evaluation by a family of formulae
This page was built for publication: Error analysis of corner cutting algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964056)
