Explicit algorithms for multiwise merging of Bézier curves
From MaRDI portal
Publication:475655
DOI10.1016/j.cam.2014.10.002zbMath1304.65102OpenAlexW2086759691MaRDI QIDQ475655
Publication date: 27 November 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2014.10.002
Related Items (3)
Merging of Bézier curves with box constraints ⋮ An iterative algorithm for \(G^2\) multiwise merging of Bézier curves ⋮ Efficient merging of multiple segments of Bézier curves
Cites Work
- Unnamed Item
- 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
- Approximate merging of a pair of Bézier curves
- Constrained multi-degree reduction of triangular Bézier surfaces using dual Bernstein polynomials
- Optimal approximate merging of a pair of Bézier curves with \(G^{2}\)-continuity
- Approximate conversion of spline curves
- Construction of dual bases
- Using Jacobi polynomials for degree reduction of Bézier curves with \(C^k\)-constraints
- Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
- Explicit \(G^2\)-constrained degree reduction of Bézier curves by quadratic optimization
- An explicit method for \(G^3\) merging of two Bézier curves
- CONSTRAINT MODELING FOR CURVES AND SURFACES IN CAGD: A SURVEY
This page was built for publication: Explicit algorithms for multiwise merging of Bézier curves
