Sharp bounds on the approximation of a Bézier polynomial by its quasi-control polygon

DOI10.1016/J.CAGD.2005.04.010zbMATH Open1083.65020OpenAlexW2033514635MaRDI QIDQ2581841FDOQ2581841

Authors: Renjiang Zhang, Guojin Wang 

Publication date: 10 January 2006

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cagd.2005.04.010

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

zbMATH Keywords

Sharp boundspolynomial surfaceIntersection testingquasi-control polygonBézier curvesBézier control points

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17)

Cites Work

• Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon
• Best bounds on the approximation of polynomials and splines by their control structure
• A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
• Surface algorithms using bounds on derivatives
• The termination criterion for subdivision of the rational Bézier curves
• Optimized refinable enclosures of multivariate polynomial pieces

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)