On the efficiency of knot insertion algorithms (Q1104032): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 02:53, 31 January 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
    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
    0 references
    0 references
    0 references
    0 references
    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