An effective bound on the gap between the control polytype and the graph of a real polynomial on a simplex

DOI10.1016/j.crma.2009.10.011zbMath1184.65027OpenAlexW2056098349MaRDI QIDQ1046529

Richard Leroy

Publication date: 22 December 2009

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2009.10.011

zbMATH Keywords

polynomialexplicit boundBernstein basiscontrol polytope

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Bézier nets, convexity and subdivision on higher-dimensional simplices
• Rates of convergence of control polygons
• 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
• Bézier and B-spline techniques
• Convergence of subdivision and degree elevation
• Unnamed Item

This page was built for publication: An effective bound on the gap between the control polytype and the graph of a real polynomial on a simplex