\(G^{k,l}\)-constrained multi-degree reduction of Bézier curves
DOI10.1007/S11075-015-9988-3zbMath1343.65017arXiv1501.03032OpenAlexW2143751457MaRDI QIDQ5962638
Przemysław Gospodarczyk, Stanisław Lewanowicz, Paweł Woźny
Publication date: 15 February 2016
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.03032
algorithmquadratic programmingnumerical examplesnonlinear programmingBézier curvesgeometric continuityboundary control pointconstrained dual Bernstein basisleast squares normmulti-degree reduction
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Computer-aided design (modeling of curves and surfaces) (65D17) Methods of successive quadratic programming type (90C55)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Iterative process for \(G^{2}\)-multi degree reduction of Bézier curves
- Multi-degree reduction of tensor product Bézier surfaces with general boundary constraints
- Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials
- Optimal multi-degree reduction of Bézier curves with \(G^2\)-continuity
- Numerical optimization. Theoretical and practice aspects
- A unified matrix representation for degree reduction of Bézier curves
- Explicit \(G^2\)-constrained degree reduction of Bézier curves by quadratic optimization
- A quadratic programming method for optimal degree reduction of Bézier curves with \(G^{1}\)-continuity
- An explicit method for \(G^3\) merging of two Bézier curves
- Matrix representation for multi-degree reduction of Bézier curves
This page was built for publication: \(G^{k,l}\)-constrained multi-degree reduction of Bézier curves