Making the Oslo Algorithm More Efficient
From MaRDI portal
Recommendations
Cited in
(21)- Knot line refinement algorithms for tensor product B-spline surfaces
- Some remarks concerning B-splines
- Knot removal for parametric B-spline curves and surfaces
- Knot insertion from a blossoming point of view
- Note on the Oslo algorithm
- Another knot insertion algorithm for B-spline curves
- Knot insertion algorithms for piecewise polynomial spaces determined by connection matrices
- Point inversion and projection for nurbs curve and surface: control polygon approach
- Curve modeling with constrained B-spline wavelets
- Fairness degree based fairness criterion and fairing algorithm
- scientific article; zbMATH DE number 432875 (Why is no real title available?)
- Control point insertion for B-spline curves
- scientific article; zbMATH DE number 4067515 (Why is no real title available?)
- A linear time Oslo algorithm
- A unified approach to evaluation algorithms for multivariate polynomials
- An algorithm for multi-resolution analysis of NURBS surfaces
- Fast algorithms for adaptive free knot spline approximation using nonuniform biorthogonal spline wavelets
- Recursive representation and application of transformation matrices of B-spline bases
- Wavelets-based NURBS simplification and fairing
- Blossoming and knot insertion algorithms for B-spline curves
- A short proof of the Oslo algorithm
This page was built for publication: Making the Oslo Algorithm More Efficient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3761542)
