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

discrete B- splinesknot insertionOslo algorithmrecurrence relationtensor product surface

Mathematics Subject Classification ID

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

Review text

This paper is concerned with the simplification of the well-known Oslo algorithm [cf. \textit{E. Cohen}, the author and \textit{R. Riesenfeld}, Comput. Graph. Image Process., 14, 87-111 (1980)] for updating the B- spline representation of a curve or tensor product surface when additional knots are included. A recurrence relation for discrete B- splines is established. Then a discrete version of Marsden's identity is derived. As a consequence, the dual linear functionals give the connection between discrete B-splines and knot insertion.

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)

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

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)