Two blossoming proofs of the Lane-Riesenfeld algorithm

DOI10.1007/S00607-006-0194-YMaRDI QIDQ884714zbMATH OpenOpenAlexFDO

Authors E. Vouga, Ron Goldman

Publication date 7 June 2007

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00607-006-0194-y

zbMATH Keywords

B-splinesblossomingknot insertionLane-Riesenfeld algorithm

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Computer-aided design (modeling of curves and surfaces) (65D17)

Review text

The original proof of the Lane-Riesenfeld algorithm for knot insertion into uniform B-spline curves is based on the continuous convolution formula for the uniform B-spline basis functions. In the case of quadratic B-splines, a straightforward proof of this algorithm was given by \textit{R. Goldman} [Pyramid algorithms: A dynamic programming approach to curves and surfaces for geometric modeling. San Diego: Morgan Kaufmann Publishers/Academic Press (2002)] using the blossoming technique. The present paper provides two new blossoming proofs of the Lane-Riesenfeld algorithm for uniform B-splines of arbitrary degree. The authors point out that it is an open problem to find a blossoming proof of the extension of the Lane-Riesenfeld algorithm to knots in geometric progression.

Recommendations

• An assertional proof of Rana's algorithm
• Proof of Rueppel's linear complexity conjecture (Corresp.)
• On de Boor-like algorithms and blossoming
• An algorithmic version of the blow-up lemma
• Algorithmic proofs of two theorems of Stafford.
• Integer Programming and Combinatorial Optimization
• An algorithmic proof of a generalization of the birkhoff-von neumann theorem
• A new proof of the Garsia-Wachs algorithm

Cites work

• A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
• Blossoming and knot insertion algorithms for B-spline curves
• Blossoms are polar forms
• scientific article; zbMATH DE number 432873 (Why is no real title available?)
• scientific article; zbMATH DE number 432874 (Why is no real title available?)

Cited in

(7)

• Yet another proof of knot insertion
• Rational linear reparametrization of NURBS and the blossoming principle
• scientific article; zbMATH DE number 1549724 (Why is no real title available?)
• Subdivide and conquer: Adapting non-manifold subdivision surfaces to surface-based representation and reconstruction of complex geological structures
• BLOOM: bimodal lattice one-out-of-many proofs and applications
• Non-uniform subdivision for B-splines of arbitrary degree
• A symmetric, non-uniform, refine and smooth subdivision algorithm for general degree B-splines

This page was built for publication: Two blossoming proofs of the Lane-Riesenfeld algorithm

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