A note on constrained degree reduction of polynomials in Bernstein-Bézier form over simplex domain

DOI10.1016/J.CAM.2008.10.032zbMath1168.65320OpenAlexW2091418895MaRDI QIDQ1023342

Li-Zheng Lu

Publication date: 11 June 2009

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2008.10.032

zbMATH Keywords

Bernstein polynomialsdegree elevationconstrained degree reductionsimplex domain

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15)

Related Items (2)

Multi-degree reduction of tensor product Bézier surfaces with general boundary constraints ⋮ Constrained multi-degree reduction of triangular Bézier surfaces using dual Bernstein polynomials

Cites Work

• Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
• Constrained degree reduction of polynomials in Bernstein-Bézier form over simplex domain

This page was built for publication: A note on constrained degree reduction of polynomials in Bernstein-Bézier form over simplex domain