On de Boor-like algorithms and blossoming

DOI10.1016/0167-8396(88)90022-2zbMath0657.65015OpenAlexW2128578858MaRDI QIDQ1110980

Wolfgang Boehm

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0167-8396(88)90022-2

zbMATH Keywords

algorithmstensor productsBézier curveslinear interpolationde Boor algorithmspline curvesAitken algorithmBézier manifoldsde Casteljou algorithmGoldman algorithmmultiaffine mappingsPolya curves

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Spline approximation (41A15)

Related Items

Symmetric triangular algorithms for curves ⋮ Exponential splines and minimal-support bases for curve representation ⋮ The Bernstein polynomial basis: a centennial retrospective ⋮ Rational parametric representation of parabolic cyclide: Formulation and applications ⋮ Symmetric recursive algorithms for surfaces: B-patches and the de Boor algorithm for polynomials over triangles

Cites Work

• A survey of curve and surface methods in CAGD
• Curvature continuous curves and surfaces
• Knot insertion from a blossoming point of view
• On calculating with B-splines
• Unnamed Item
• Unnamed Item
• Unnamed Item