Merging of Bézier curves with box constraints

DOI10.1016/J.CAM.2015.10.005MaRDI QIDQ898952zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

quadratic programmingbox constraintsparametric continuitymergingmultiple segmentsBézier curve

Mathematics Subject Classification ID

Quadratic programming (90C20) Computer-aided design (modeling of curves and surfaces) (65D17)

Abstract: In this paper, we present a novel approach to the problem of merging of B'ezier curves with respect to the $L_2$-norm. We give illustrative examples to show that the solution of the conventional merging problem may not be suitable for further modification and applications. As in the case of the degree reduction problem, we apply the so-called restricted area approach -- proposed recently in (P. Gospodarczyk, Computer-Aided Design 62 (2015), 143--151) -- to avoid certain defects and make the resulting curve more useful. A method of solving the new problem is based on box-constrained quadratic programming approach.

Recommendations

• Approximate merging of a pair of Bézier curves
• Efficient merging of multiple segments of Bézier curves
• Explicit algorithms for multiwise merging of Bézier curves
• scientific article; zbMATH DE number 2185875
• Fairing Bézier curves with constraints
• scientific article; zbMATH DE number 2161572
• An explicit method for \(G^3\) merging of two Bézier curves
• Optimal approximate merging of a pair of Bézier curves with \(G^{2}\)-continuity
• An iterative algorithm for G^2 multiwise merging of Bézier curves
• Approximate merging of Bézier curves with generalized inverse matrices

Cites work

• scientific article; zbMATH DE number 4199975 (Why is no real title available?)
• A block active set algorithm for large-scale quadratic programming with box constraints
• Algorithms for bound constrained quadratic programming problems
• 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
• Efficient merging of multiple segments of Bézier curves
• Explicit algorithms for multiwise merging of Bézier curves
• Optimal approximate merging of a pair of Bézier curves with \(G^{2}\)-continuity
• Optimal quadratic programming algorithms. With applications to variational inequalities

Cited in

(3)

• An iterative algorithm for \(G^2\) multiwise merging of Bézier curves
• Efficient merging of multiple segments of Bézier curves
• Approximate merging of a pair of Bézier curves

This page was built for publication: Merging of Bézier curves with box constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898952)