Optimal constrained multi-degree reduction of Bézier curves with explicit expressions based on divide and conquer
From MaRDI portal
Publication:1048314
DOI10.1631/JZUS.A0820290zbMATH Open1181.65027OpenAlexW2072206471MaRDI QIDQ1048314FDOQ1048314
Publication date: 11 January 2010
Published in: Journal of Zhejiang University. Science A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1631/jzus.a0820290
least squares methodJacobi polynomialsgraphical examplesdivide and conquerinterpolationsmulti-degree reductionBézier curves
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiple Degree Reduction and Elevation of Bézier Curves Using Jacobi–Bernstein Basis Transformations
- Chebyshev economization for parametric surfaces
- A simple matrix form for degree reduction of Bézier curves using Chebyshev-Bernstein basis transformations
- Matrix representation for multi-degree reduction of Bézier curves
- Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
- Degree reduction of Bézier curves
- Interactive Interpolation and Approximation by Bezier Polynomials
- Constrained Bézier curves' best multi-degree reduction in the \(L_2\)-norm
- Approximate conversion of spline curves
- Approximate conversion of surface representations with polynomial bases
- Perturbing Béziercoefficients for best constrained degree reduction in the L2-norm
- Degree reduction of Bézier simplexes
Cited In (4)
This page was built for publication: Optimal constrained multi-degree reduction of Bézier curves with explicit expressions based on divide and conquer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1048314)
