Pseudoaffinity, de Boor algorithm, and blossoms

DOI10.1007/S10444-005-7450-0MaRDI QIDQ878093zbMATH OpenOpenAlexFDO

Authors Marie-Laurence Mazure

Publication date 26 April 2007

Published in Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10444-005-7450-0

zbMATH Keywords

geometric designblossomingChebyshev splinesB-spline basesChebyshev spacespseudoaffinity

Mathematics Subject Classification ID

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

Recommendations

• A new multiaffine approach to B-splines
• scientific article; zbMATH DE number 844465
• Four properties to characterize Chebyshev blossoms
• Blossoming stories
• On the equivalence between existence of B-spline bases and existence of blossoms

Cites work

• scientific article; zbMATH DE number 3703310 (Why is no real title available?)
• scientific article; zbMATH DE number 1136348 (Why is no real title available?)
• A recurrence relation for Chebyshevian B-splines
• B-spline bases and osculating flats: One result of H.-P. Seidel revisited
• Blossoming beyond extended Chebyshev spaces
• Blossoming: A geometrical approach
• Blossoms and optimal bases
• Blossoms are polar forms
• Four properties to characterize Chebyshev blossoms
• New algorithms and techniques for computing with geometrically continuous spline curves of arbitrary degree
• On the equivalence between existence of \(B\)-spline bases and existence of blossoms
• Piecewise polynomial spaces and geometric continuity of curves
• Properties of \(\beta\)-splines
• The geometry of Tchebycheffian splines
• de Boor-fix dual functionals and algorithms for Tchebycheffian B-spline curves

Cited in

(1)

• BLOOM: bimodal lattice one-out-of-many proofs and applications

This page was built for publication: Pseudoaffinity, de Boor algorithm, and blossoms

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