Note on the Oslo algorithm

DOI10.1016/0010-4485(88)90118-2MaRDI QIDQ1116634zbMATH OpenOpenAlexFDO

Authors Tom Lyche

Publication date 1988

Published in CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0010-4485(88)90118-2

zbMATH Keywords

recurrence relationknot insertiontensor product surfaceOslo algorithmdiscrete B- splines

Mathematics Subject Classification ID

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

Recommendations

• Making the Oslo Algorithm More Efficient
• A linear time Oslo algorithm
• Some remarks concerning B-splines
• scientific article; zbMATH DE number 4067515
• scientific article; zbMATH DE number 432875

Cited in

(10)

• Blossoming Marsden's identity
• A linear time Oslo algorithm
• De Boor-Fix functionals and polar forms
• Some identities for product and degree raising of splines
• Some remarks concerning B-splines
• A short proof of the Oslo algorithm
• Making the Oslo Algorithm More Efficient
• Knot line refinement algorithms for tensor product B-spline surfaces
• scientific article; zbMATH DE number 432875 (Why is no real title available?)
• scientific article; zbMATH DE number 4067515 (Why is no real title available?)

This page was built for publication: Note on the Oslo algorithm

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