On the efficiency of knot insertion algorithms
DOI10.1016/0167-8396(85)90017-2zbMATH Open0646.65011OpenAlexW2143856056MaRDI QIDQ1104032FDOQ1104032
Authors: 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
Recommendations
algorithmsB-splinescomparison of methodslinear combinationssubdivisionrefinementsspline surfacesspline curvesknot insertion algorithmssubdividing
Numerical computation using splines (65D07) Interpolation in approximation theory (41A05) Curves in Euclidean and related spaces (53A04) Surfaces in Euclidean and related spaces (53A05)
Cites Work
Cited In (11)
- New insight into multilevel local refinement in adaptive isogeometric analysis
- On the uniqueness of knot insertion procedures.
- Knot insertion algorithms and local linear independence
- Selective knot insertion for symmetric, non-uniform refine and smooth B-spline subdivision
- Blossoming and knot insertion algorithms for B-spline curves
- Another knot insertion algorithm for B-spline curves
- Efficient extraction of hierarchical B-splines for local refinement and coarsening of isogeometric analysis
- AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS
- Extrapolating acceleration algorithms for finding \(B\)-spline intersections using recursive subdivision techniques
- Multi-level Bézier extraction for hierarchical local refinement of isogeometric analysis
- Knot insertion from a blossoming point of view
This page was built for publication: On the efficiency of knot insertion algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104032)