Approximating a composite cubic curve by one with fewer pieces (Q1109505)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating a composite cubic curve by one with fewer pieces |
scientific article; zbMATH DE number 4070150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating a composite cubic curve by one with fewer pieces |
scientific article; zbMATH DE number 4070150 |
Statements
Approximating a composite cubic curve by one with fewer pieces (English)
0 references
1987
0 references
A basic algorithm for merging two adjacent cubic pieces of a given composite cubic curve is suggested here. As a typical application, it is combined with a standard interpolating scheme to approximate a sequence of data points by a composite cubic of few pieces.
0 references
algorithm
0 references
composite cubic curve
0 references
0.8132641911506653
0 references
0.8075737357139587
0 references
0.7726770043373108
0 references
