Polynomial degree reduction in the \(L_2\)-norm equals best Euclidean approximation of Bézier coefficients

DOI10.1016/S0167-8396(99)00025-4zbMath0993.41016MaRDI QIDQ1605741

Jörg Peters, Ulrich Reif, David Lutterkort

Publication date: 23 July 2002

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

zbMATH Keywords

Bernstein-Bézier polynomialpolynomial degree reductionbest \(L_2\)-approximationbest Euclidean approximation

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Approximation by polynomials (41A10)

Related Items (22)

Continuous and discrete best polynomial degree reduction with Jacobi and Hahn weights ⋮ Polynomial degree reduction in the discrete \(L_2\)-norm equals best Euclidean approximation of \(h\)-Bézier coefficients ⋮ Constrained multi-degree reduction with respect to Jacobi norms ⋮ Application of degree reduction of polynomial Bézier curves to rational case ⋮ Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients ⋮ Multi-degree reduction of Bézier curves for fixed endpoints using Lagrange multipliers ⋮ Finite alternation theorems and a constructive approach to piecewise polynomial approximation in Chebyshev norm ⋮ Distance for degree raising and reduction of triangular Bézier surfaces ⋮ The Bernstein polynomial basis: a centennial retrospective ⋮ Explicit \(G^2\)-constrained degree reduction of Bézier curves by quadratic optimization ⋮ Best polynomial degree reduction on \(q\)-lattices with applications to \(q\)-orthogonal polynomials ⋮ L-2 DEGREE REDUCTION OF TRIANGULAR BÉZIER SURFACES WITH COMMON TANGENT PLANES AT VERTICES ⋮ A simple matrix form for degree reduction of Bézier curves using Chebyshev-Bernstein basis transformations ⋮ Constrained degree reduction of polynomials in Bernstein-Bézier form over simplex domain ⋮ Iterative process for \(G^{2}\)-multi degree reduction of Bézier curves ⋮ Dual basis functions in subspaces of inner product spaces ⋮ Approximate merging of B-spline curves and surfaces ⋮ Multiple Degree Reduction and Elevation of Bézier Curves Using Jacobi–Bernstein Basis Transformations ⋮ Computing roots of polynomials by quadratic clipping ⋮ Bézier projection: a unified approach for local projection and quadrature-free refinement and coarsening of NURBS and T-splines with particular application to isogeometric design and analysis ⋮ Degree reduction of Béezier curves using constrained Chebyshev polynomials of the second kind ⋮ Degree reduction of \(S-\lambda\) curves using a genetic simulated annealing algorithm

This page was built for publication: Polynomial degree reduction in the \(L_2\)-norm equals best Euclidean approximation of Bézier coefficients