de Boor's algorithm
Summary
De Boor's algorithm evaluates a spline written in the B-spline basis at a point. It replaces the coefficients of the B-splines that are active at the point by repeated convex combinations, until a single value remains. It needs no explicit B-spline values, is numerically stable, and generalizes de Casteljau's algorithm for Bézier curves.
Further reading
About this page
| Tag | 5JHFB384BF |
|---|---|
| URI | m2://5JHFB384BF |
| Kind | concept |
| Writing | W0 stub |
| MSC | 65D07, 41A15, 65D17 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.