Merging of Bézier curves with box constraints
From MaRDI portal
Publication:898952
DOI10.1016/j.cam.2015.10.005zbMath1382.65043arXiv1412.3841OpenAlexW2137703362MaRDI QIDQ898952
Przemysław Gospodarczyk, Paweł Woźny
Publication date: 21 December 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.3841
Related Items (1)
Cites Work
- Explicit algorithms for multiwise merging of Bézier curves
- Approximate merging of a pair of Bézier curves
- Efficient merging of multiple segments of Bézier curves
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Optimal approximate merging of a pair of Bézier curves with \(G^{2}\)-continuity
- Approximate conversion of spline curves
- Algorithms for bound constrained quadratic programming problems
- A block active set algorithm for large-scale quadratic programming with box constraints
- An explicit method for \(G^3\) merging of two Bézier curves
- Unnamed Item
This page was built for publication: Merging of Bézier curves with box constraints