Fairing composite polynomial curves with constraints (Q1315803): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q390623 |
||
| Property / reviewed by | |||
| Property / reviewed by: Jürgen Prestin / rank | |||
Revision as of 11:50, 14 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fairing composite polynomial curves with constraints |
scientific article |
Statements
Fairing composite polynomial curves with constraints (English)
0 references
24 March 1994
0 references
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.
0 references
fairing with constraints
0 references
area constraints
0 references
composite polynomial curves
0 references
quasi-Newton methods
0 references
