Polynomial degree reduction in the discrete L₂-norm equals best Euclidean approximation of h-Bézier coefficients
DOI10.1007/S10543-015-0558-9zbMATH Open1342.65090OpenAlexW1918332275MaRDI QIDQ285260FDOQ285260
Authors: Rachid Ait-Haddou 
Publication date: 19 May 2016
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-015-0558-9
Recommendations
- Polynomial degree reduction in the \(L_2\)-norm equals best Euclidean approximation of Bézier coefficients
- Constrained multi-degree reduction with respect to Jacobi norms
- Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
- Continuous and discrete best polynomial degree reduction with Jacobi and Hahn weights
- A note on the paper ``Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients.
Approximation by polynomials (41A10) Best approximation, Chebyshev systems (41A50) Computer-aided design (modeling of curves and surfaces) (65D17) Approximation with constraints (41A29)
Cites Work
- The geometry of optimal degree reduction of Bézier curves
- Legendre-Bernstein basis transformations
- Discrete Bernstein bases and Hahn polynomials
- Degree reduction of Bézier curves by \(L^ 1\)-approximation with endpoint interpolation
- Least squares approximation of Bézier coefficients provides best degree reduction in the \(L_2\)-norm
- Polynomial degree reduction in the \(L_2\)-norm equals best Euclidean approximation of Bézier coefficients
- Gelfond-Bézier curves
- A Müntz type theorem for a family of corner cutting schemes
- Chebyshev blossoming in Müntz spaces: toward shaping with Young diagrams
- Asymptotic convergence of degree-raising
- Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
- Explicit Formula Relating the Jacobi, Hahn and Bernstein Polynomials
- Discrete (Legendre) orthogonal polynomials-a survey
- \(h\)-blossoming: A new approach to algorithms and identities for \(h\)-Bernstein bases and \(h\)-Bézier curves
- Title not available (Why is that?)
- Distance for Bézier curves and degree reduction
- Two essential properties of \((q, h)\)-Bernstein-Bézier curves
- Degree reduction of Bézier curves
- Degree reduction of Bézier curves
Cited In (7)
- Continuous and discrete best polynomial degree reduction with Jacobi and Hahn weights
- Best polynomial degree reduction on \(q\)-lattices with applications to \(q\)-orthogonal polynomials
- Polynomial degree reduction in the \(L_2\)-norm equals best Euclidean approximation of Bézier coefficients
- Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
- Constrained multi-degree reduction with respect to Jacobi norms
- Polynomial degree reduction in the \(\mathcal{L}^2\)-norm on a symmetric interval for the canonical basis
- A note on the paper ``Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients.
This page was built for publication: Polynomial degree reduction in the discrete \(L_2\)-norm equals best Euclidean approximation of \(h\)-Bézier coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285260)
