On the efficiency of knot insertion algorithms

DOI10.1016/0167-8396(85)90017-2zbMath0646.65011OpenAlexW2143856056MaRDI QIDQ1104032

Wolfgang Boehm

Publication date: 1985

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

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

zbMATH Keywords

algorithmscomparison of methodssubdivisionB-splinesrefinementslinear combinationsspline surfacesspline curvesknot insertion algorithmssubdividing

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Interpolation in approximation theory (41A05) Surfaces in Euclidean and related spaces (53A05) Curves in Euclidean and related spaces (53A04)

Related Items

Knot insertion from a blossoming point of view ⋮ Efficient extraction of hierarchical B-splines for local refinement and coarsening of isogeometric analysis ⋮ Selective knot insertion for symmetric, non-uniform refine and smooth B-spline subdivision ⋮ Another knot insertion algorithm for B-spline curves ⋮ Blossoming and knot insertion algorithms for B-spline curves ⋮ Multi-level Bézier extraction for hierarchical local refinement of isogeometric analysis ⋮ Extrapolating acceleration algorithms for finding \(B\)-spline intersections using recursive subdivision techniques

Cites Work

• Knot line refinement algorithms for tensor product B-spline surfaces