On the efficiency of knot insertion algorithms (Q1104032)
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: On the efficiency of knot insertion algorithms |
scientific article; zbMATH DE number 4054899
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the efficiency of knot insertion algorithms |
scientific article; zbMATH DE number 4054899 |
Statements
On the efficiency of knot insertion algorithms (English)
0 references
1985
0 references
The paper presents the principal difference of two knot insertion algorithms. Their efficiencies are compared. Both the algorithms chiefly use linear combinations. A table comparing the count of linear combinations is provided.
0 references
algorithms
0 references
subdividing
0 references
subdivision
0 references
refinements
0 references
B-splines
0 references
spline curves
0 references
spline surfaces
0 references
comparison of methods
0 references
knot insertion algorithms
0 references
linear combinations
0 references
0.8243731260299683
0 references
0.7908757328987122
0 references
0.7908757328987122
0 references
0.7538818717002869
0 references
