Two blossoming proofs of the Lane-Riesenfeld algorithm
From MaRDI portal
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
- scientific article; zbMATH DE number 432873 (Why is no real title available?)
- scientific article; zbMATH DE number 432874 (Why is no real title available?)
- 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
Cited in
(7)- BLOOM: bimodal lattice one-out-of-many proofs and applications
- A symmetric, non-uniform, refine and smooth subdivision algorithm for general degree B-splines
- Non-uniform subdivision for B-splines of arbitrary degree
- Yet another proof of knot insertion
- Subdivide and conquer: Adapting non-manifold subdivision surfaces to surface-based representation and reconstruction of complex geological structures
- Rational linear reparametrization of NURBS and the blossoming principle
- scientific article; zbMATH DE number 1549724 (Why is no real title available?)
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)
