Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2008/iii/paper-77/3/i/solution
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 77 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write a degree- B-spline as and locate its spline knot span. There are several equivalent exact evaluation methods.
Evaluate the at most nonzero basis functions by the Cox-de Boor recurrence, then form their weighted sum of control points. Alternatively apply De Boor's algorithm directly to the active control points. In a span , initialize and repeatedly interpolate:for and . The last point is ; zero knot intervals are handled by the standard limiting convention or an appropriate neighboring nonempty span.
A third method precomputes the local polynomial coefficients on each span and evaluates them by Horner's method. For a uniform cubic B-spline, a fixed four-by-four basis matrix gives these coefficients. A fourth method uses knot insertion to express the relevant span as a Bézier curve, followed by De Casteljau's algorithm. Both interpolation algorithms also split the curve at the requested parameter. Repeated subdivision supplies arbitrarily accurate polygonal evaluation, although a finite subdivision mesh is generally an approximation rather than the exact requested point. Basis summation, de Boor interpolation, local polynomial evaluation and Bézier extraction are equivalent exact representations.
New to topics? Read the docs here!