Matrix representation for multi-degree reduction of Bézier curves
From MaRDI portal
Publication:2573854
DOI10.1016/j.cagd.2004.12.002zbMath1087.65014MaRDI QIDQ2573854
Publication date: 25 November 2005
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2004.12.002
Jacobi polynomials; matrix representation; Bézier curves; degree reduction; least squares solution; endpoints continuity
65D17: Computer-aided design (modeling of curves and surfaces)
Related Items
Multi-degree reduction of Bézier curves for fixed endpoints using Lagrange multipliers, Constrained multi-degree reduction of Bézier surfaces using Jacobi polynomials, Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials, Computing roots of polynomials by quadratic clipping, Application of Chebyshev II-Bernstein basis transformations to degree reduction of Bézier curves, Optimal approximate merging of a pair of Bézier curves with \(G^{2}\)-continuity, Optimal constrained multi-degree reduction of Bézier curves with explicit expressions based on divide and conquer, Approximating tensor product Bézier surfaces with tangent plane continuity, Constrained degree reduction of polynomials in Bernstein-Bézier form over simplex domain
Cites Work
- Basis conversion among Bézier, Tchebyshev and Legendre
- A unified matrix representation for degree reduction of Bézier curves
- Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
- Distance for Bézier curves and degree reduction
- Interactive Interpolation and Approximation by Bezier Polynomials
