A short proof of the Oslo algorithm

DOI10.1016/0167-8396(84)90007-4MaRDI QIDQ801629zbMATH OpenOpenAlexFDO

Authors Hartmut Prautzsch

Publication date 1984

Published in Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8396(84)90007-4

zbMATH Keywords

B-splinesOslo-algorithm

Mathematics Subject Classification ID

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

Review text

A short proof of the Oslo-algorithm [cf. \textit{E. Cohen} et al., Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics, Comput. Graphics Image Process. 14, 87-111 (1980)] is presented that uses a simple comparison of coefficients.

Recommendations

• Making the Oslo Algorithm More Efficient
• A linear time Oslo algorithm
• Note on the Oslo algorithm
• A short proof of the formula for layer addition
• Some remarks concerning B-splines

Cites work

• On calculating with B-splines

Cited in

(5)

• Some remarks concerning B-splines
• Knot insertion from a blossoming point of view
• A short proof of an algorithm by Boehm
• Convergence of subdivision and degree elevation
• Point inversion and projection for nurbs curve and surface: control polygon approach

This page was built for publication: A short proof of the Oslo algorithm

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