Knot insertion algorithms and local linear independence

MaRDI QIDQ2754305zbMATH OpenFDO

Authors Esmeralda Mainar, J. M. Peña

Publication date 11 November 2001

zbMATH Keywords

computer aided geometric designknot insertion algorithmsnormalized B-basesshape preserving representationssplines

Mathematics Subject Classification ID

Spline approximation (41A15) Numerical computation using splines (65D07) Computer-aided design (modeling of curves and surfaces) (65D17)

Recommendations

• On the efficiency of knot insertion algorithms
• Knot insertion algorithms for piecewise polynomial spaces determined by connection matrices
• scientific article; zbMATH DE number 432874
• Local and algorithmic moves of knots according to Lackenby
• Low complexity algorithms in knot theory
• scientific article; zbMATH DE number 2163273
• Algorithms in low-dimensional topology: holonomic parametrization of knots
• Linear independence of rationally slice knots
• Knot insertion and totally positive systems
• scientific article; zbMATH DE number 1187105

Cited in

(2)

• Knot insertion and totally positive systems
• On the Local Linear Independence of Generalized Subdivision Functions

This page was built for publication: Knot insertion algorithms and local linear independence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754305)