On the efficiency of knot insertion algorithms
From MaRDI portal
Recommendations
Cited in
(11)- New insight into multilevel local refinement in adaptive isogeometric analysis
- Selective knot insertion for symmetric, non-uniform refine and smooth B-spline subdivision
- On the uniqueness of knot insertion procedures.
- Knot insertion algorithms and local linear independence
- 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
- Extrapolating acceleration algorithms for finding \(B\)-spline intersections using recursive subdivision techniques
- AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS
- 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)