Blossoming and knot insertion algorithms for B-spline curves

DOI10.1016/0167-8396(90)90022-JzbMath0713.65006MaRDI QIDQ750080

Ronald N. Goldman

Publication date: 1990

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

zbMATH Keywords

B-spline curvesBlossomingOslo knot insertion algorithm

Mathematics Subject Classification ID

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

Related Items

Knot insertion algorithms for piecewise polynomial spaces determined by connection matrices ⋮ A unified approach to non-polynomial B-spline curves based on a novel variant of the polar form ⋮ Two blossoming proofs of the Lane-Riesenfeld algorithm ⋮ Bivariate non-uniform subdivision schemes based on L-systems ⋮ Selective knot insertion for symmetric, non-uniform refine and smooth B-spline subdivision ⋮ L-system specification of knot-insertion rules for non-uniform B-spline subdivision ⋮ Cubic spline quasi-interpolants on powell-sabin partitions ⋮ Another knot insertion algorithm for B-spline curves ⋮ Construction of spherical spline quasi-interpolants based on blossoming

Cites Work

• Blossoms are polar forms
• On the efficiency of knot insertion algorithms
• Knot insertion from a blossoming point of view
• On calculating with B-splines
• Making the Oslo Algorithm More Efficient
• Unnamed Item