Explicit algorithms for multiwise merging of Bézier curves
From MaRDI portal
(Redirected from Publication:475655)
Recommendations
- An iterative algorithm for G^2 multiwise merging of Bézier curves
- An explicit method for \(G^3\) merging of two Bézier curves
- Efficient merging of multiple segments of Bézier curves
- Optimal approximate merging of a pair of Bézier curves with \(G^{2}\)-continuity
- Approximate merging of a pair of Bézier curves
Cites work
- scientific article; zbMATH DE number 5190601 (Why is no real title available?)
- An explicit method for \(G^3\) merging of two Bézier curves
- Approximate conversion of spline curves
- Approximate merging of a pair of Bézier curves
- CONSTRAINT MODELING FOR CURVES AND SURFACES IN CAGD: A SURVEY
- Constrained multi-degree reduction of Bézier surfaces using Jacobi polynomials
- Constrained multi-degree reduction of triangular Bézier surfaces using dual Bernstein polynomials
- Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
- Construction of dual bases
- Explicit \(G^2\)-constrained degree reduction of Bézier curves by quadratic optimization
- Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials
- Optimal approximate merging of a pair of Bézier curves with \(G^{2}\)-continuity
- Using Jacobi polynomials for degree reduction of Bézier curves with \(C^k\)-constraints
Cited in
(5)- Efficient merging of multiple segments of Bézier curves
- scientific article; zbMATH DE number 2161572 (Why is no real title available?)
- An iterative algorithm for G^2 multiwise merging of Bézier curves
- Merging of Bézier curves with box constraints
- An explicit method for \(G^3\) merging of two Bézier curves
This page was built for publication: Explicit algorithms for multiwise merging of Bézier curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475655)
