Knot insertion from a blossoming point of view

DOI10.1016/0167-8396(88)90023-4zbMath0665.65009OpenAlexW2076535710MaRDI QIDQ1116265

Hans-Peter Seidel

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)90023-4

zbMATH Keywords

subdivisionB-splineknot insertionblossomde Boor algorithmmultiaffine

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Spline approximation (41A15)

Related Items

Knot insertion algorithms for piecewise polynomial spaces determined by connection matrices, Helix splines as an example of affine Tchebycheffian splines, Symmetric triangular algorithms for curves, New algorithms and techniques for computing with geometrically continuous spline curves of arbitrary degree, On de Boor-like algorithms and blossoming, Yet another proof of knot insertion, A new multiaffine approach to B-splines, De Boor-Fix functionals and polar forms, Erratum to: Yet another proof of knot insertion, Adaptive finite element methods for elliptic equations over hierarchical T-meshes, A characterization theorem of multivariate splines in blossoming form, The geometry of Tchebycheffian splines, Blossoming and knot insertion algorithms for B-spline curves, Symmetric recursive algorithms for surfaces: B-patches and the de Boor algorithm for polynomials over triangles

Cites Work

• A short proof of the Oslo algorithm
• Knot line refinement algorithms for tensor product B-spline surfaces
• A survey of curve and surface methods in CAGD
• On the efficiency of knot insertion algorithms
• A practical guide to splines
• Making the Oslo Algorithm More Efficient