Note on the Oslo algorithm

DOI10.1016/0010-4485(88)90118-2zbMATH Open0666.65012OpenAlexW2062268003MaRDI QIDQ1116634FDOQ1116634

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

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

zbMATH Keywords

recurrence relationknot insertiontensor product surfaceOslo algorithmdiscrete B- splines

Mathematics Subject Classification ID

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

Cited In (10)

• Making the Oslo Algorithm More Efficient
• Some remarks concerning B-splines
• A linear time Oslo algorithm
• Knot line refinement algorithms for tensor product B-spline surfaces
• Blossoming Marsden's identity
• Title not available (Why is that?)
• De Boor-Fix functionals and polar forms
• Some identities for product and degree raising of splines
• Title not available (Why is that?)
• A short proof of the Oslo algorithm

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)