Computing nodes for plane data points by constructing cubic polynomial with constraints (Q6563925)
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: Computing nodes for plane data points by constructing cubic polynomial with constraints |
scientific article; zbMATH DE number 7873091
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing nodes for plane data points by constructing cubic polynomial with constraints |
scientific article; zbMATH DE number 7873091 |
Statements
Computing nodes for plane data points by constructing cubic polynomial with constraints (English)
0 references
28 June 2024
0 references
parameterization
0 references
accuracy
0 references
quadratic polynomial
0 references
shape of data
0 references
curve
0 references
0 references
