Polynomial degree reduction in the discrete L₂-norm equals best Euclidean approximation of h-Bézier coefficients
From MaRDI portal
(Redirected from Publication:285260)
Polynomial degree reduction in the discrete \(L 2\)-norm equals best Euclidean approximation of \(h\)-Bézier coefficients
Polynomial degree reduction in the discrete \(L 2\)-norm equals best Euclidean approximation of \(h\)-Bézier coefficients
Recommendations
- Polynomial degree reduction in the L₂-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.
Cites work
- scientific article; zbMATH DE number 491264 (Why is no real title available?)
- A Müntz type theorem for a family of corner cutting schemes
- Asymptotic convergence of degree-raising
- Chebyshev blossoming in Müntz spaces: toward shaping with Young diagrams
- Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
- Degree reduction of Bézier curves
- Degree reduction of Bézier curves
- Degree reduction of Bézier curves by \(L^ 1\)-approximation with endpoint interpolation
- Discrete (Legendre) orthogonal polynomials-a survey
- Discrete Bernstein bases and Hahn polynomials
- Distance for Bézier curves and degree reduction
- Explicit Formula Relating the Jacobi, Hahn and Bernstein Polynomials
- Gelfond-Bézier curves
- Least squares approximation of Bézier coefficients provides best degree reduction in the \(L_2\)-norm
- Legendre-Bernstein basis transformations
- Polynomial degree reduction in the L₂-norm equals best Euclidean approximation of Bézier coefficients
- The geometry of optimal degree reduction of Bézier curves
- Two essential properties of \((q, h)\)-Bernstein-Bézier curves
- \(h\)-blossoming: A new approach to algorithms and identities for \(h\)-Bernstein bases and \(h\)-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₂-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)
