Sharp bounds on the approximation of a Bézier polynomial by its quasi-control polygon
From MaRDI portal
Publication:2581841
Recommendations
- Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon
- scientific article; zbMATH DE number 2091787
- Consolidated sharp bounds for Bézier curve approximation with cutdown polygon and corner cutting polygon
- Best bounds on the approximation of polynomials and splines by their control structure
- A simple and efficient approximation of a Bézier piece by its cutdown polygon
Cites work
- A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
- Best bounds on the approximation of polynomials and splines by their control structure
- Optimized refinable enclosures of multivariate polynomial pieces
- Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon
- Surface algorithms using bounds on derivatives
- The termination criterion for subdivision of the rational Bézier curves
Cited in
(6)- Best bounds on the distance between 3-direction quartic box spline surface and its control net
- Revisiting the problem of zeros of univariate scalar Béziers
- Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon
- A simple and efficient approximation of a Bézier piece by its cutdown polygon
- Consolidated sharp bounds for Bézier curve approximation with cutdown polygon and corner cutting polygon
- Improved subdivision scheme for the root computation of univariate polynomial equations
This page was built for publication: Sharp bounds on the approximation of a Bézier polynomial by its quasi-control polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581841)