On the efficiency of knot insertion algorithms (Q1104032): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-8396(85)90017-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2143856056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Knot line refinement algorithms for tensor product B-spline surfaces / rank | |||
Normal rank | |||
Latest revision as of 17:38, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the efficiency of knot insertion algorithms |
scientific article |
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
