Fairing composite polynomial curves with constraints
type: Item
instance of: scholarly article
title: Fairing composite polynomial curves with constraints
zbMATH Open document ID: 0802.65006
DOI: 10.1016/0167-8396(94)90022-1
author: H. Nowacki
author: Xinmin Lu
published in: Computer Aided Geometric Design
publication date: 1994-03-24T00:00:00Z
review text: The authors develop a method for constructing planar composite polynomial curves to approximate given points with an area constraint. These constraints are described in terms of the second and third derivative. The fairing procedure yields a quintic polynomial curve which approximates the given points. The concluding equations of the optimization problem are solved by quasi-Newton methods. Several examples were chosen to illustrate the feasibility of this method.
Mathematics Subject Classification ID: 65D17
Mathematics Subject Classification ID: 65D10
zbMATH DE Number: 516605
zbMATH Keywords: fairing with constraints
zbMATH Keywords: area constraints
zbMATH Keywords: composite polynomial curves
zbMATH Keywords: quasi-Newton methods
reviewed by: Jürgen Prestin
MaRDI profile type: Publication
full work available at URL: 0167-8396(94)90022-1
OpenAlex ID: W2026500398
cites work: Q4401579
cites work: Intrinsic parametrization for approximation
cites work: Interpolating curves with gradual changes in curvature
cites work: Fairing Bézier curves with constraints
cites work: Smoothing by spline functions. II
Wikidata QID: Q127011619
description: scientific article; zbMATH DE number 516605