A simple and efficient approximation of a Bézier piece by its cutdown polygon

DOI10.1016/j.cagd.2008.08.002zbMath1205.65112OpenAlexW1982421163MaRDI QIDQ625184

Ren-Jiang Zhang, Weiyin Ma

Publication date: 15 February 2011

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

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

zbMATH Keywords

approximationBézier curvesestimate boundsintersection testing

Mathematics Subject Classification ID

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

Related Items (2)

Approximating odd degree Bézier pieces by degree-elevation cutdown polygons ⋮ Consolidated sharp bounds for Bézier curve approximation with cutdown polygon and corner cutting polygon

Cites Work

• Unnamed Item
• Surface algorithms using bounds on derivatives
• Best bounds on the approximation of polynomials and splines by their control structure
• Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon
• Sharp bounds on the approximation of a Bézier polynomial by its quasi-control polygon
• The termination criterion for subdivision of the rational Bézier curves
• A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
• Mathematics of Surfaces
• Efficient Piecewise Linear Approximation of Bézier Curves with Improved Sharp Error Bound
• Tight linear envelopes for splines
• Optimized refinable enclosures of multivariate polynomial pieces

This page was built for publication: A simple and efficient approximation of a Bézier piece by its cutdown polygon