Making the Oslo Algorithm More Efficient

DOI10.1137/0723042zbMath0623.65009OpenAlexW1996984003MaRDI QIDQ3761542

Tom Lyche, Knut M. Mørken

Publication date: 1986

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0723042

zbMATH Keywords

subdivisiondivided differencesdiscrete B-splinesOslo algorithm

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Spline approximation (41A15)

Related Items

Knot line refinement algorithms for tensor product B-spline surfaces, Fairness degree based fairness criterion and fairing algorithm, Knot insertion algorithms for piecewise polynomial spaces determined by connection matrices, Knot removal for parametric B-spline curves and surfaces, Point inversion and projection for nurbs curve and surface: control polygon approach, Knot insertion from a blossoming point of view, Recursive representation and application of transformation matrices of B-spline bases, Wavelets-based NURBS simplification and fairing, Control point insertion for B-spline curves, A unified approach to evaluation algorithms for multivariate polynomials, Another knot insertion algorithm for B-spline curves, An algorithm for multi-resolution analysis of NURBS surfaces, Blossoming and knot insertion algorithms for B-spline curves, Curve modeling with constrained B-spline wavelets, Fast Algorithms for Adaptive Free Knot Spline Approximation Using Nonuniform Biorthogonal Spline Wavelets