Pseudoaffinity, de Boor algorithm, and blossoms

DOI10.1007/S10444-005-7450-0zbMATH Open1122.65019OpenAlexW2086462976MaRDI QIDQ878093FDOQ878093

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

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

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)

Cites Work

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

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)