Control-point influence on a curve 2026-10-14
For a parametric curve represented by fixed scalar functions and control points in Euclidean space, writeThe influence function of this handle is : the resulting displacement vector is , and its norm is . These are exact finite changes, not only a first-order estimate. Where is negative the displacement points opposite to . Where , the curve is unchanged at that parameter.
The influence coefficient 3t(1-t)^2 equals the vertical displacement for a unit upward move of P1, reaches 4/9 at t=1/3, and vanishes at both endpoints
. Details. For the cubic Bézier curve above, the Bernstein basis influence function is . Its derivative isIt increases up to and decreases thereafter on . Consequently the largest displacement at corresponding parameters isFor it is . This is a comparison at the same parameter. A geometric closest-distance comparison, as in a closest-point search on a subdivision curve, instead minimizes over another parameter:The closest parameter can differ from , so is not automatically a maximum closest-distance separation of the two curves. Neither parameter is assumed to be arc length.
The support of a function is the closure of the parameter values where . It bounds where a nonzero handle move can act, but may include boundary points where the actual displacement is zero. Here the support of a function is all of relative to the parameter domain, while the endpoints are unaffected. In contrast, a B-spline of order has support within in its spline knot sequence, so its handle affects only that parameter range; the support and Gram bandwidth of B-splines describes the same locality in another application. Changing the spline knots or the basis along with the handle requires a different comparison.
When the basis functions form a partition of unity, , each evaluation is an affine combination of the control points. Applying an affine map to all handles givesThis is affine equivariance of a geometric basis, also called affine covariance: affine maps preserve affine combinations. In particular, translating every handle by translates the whole curve by , whereas moving just one handle produces . The Bernstein basis has this partition of unity property.[ref]
Curves and Surfaces in Geometric Modeling: Theory and Algorithms by Jean Gallier. §4.3, pp. 132–133: Bernstein weights sum to one
Nonnegative weights further make evaluations convex combinations, giving the convex hull bound illustrated by the control polygon; nonnegativity is not needed for affine covariance.For a proof outline of the influence formula, subtract the two basis representations: every unchanged coefficient cancels, leaving . The same subtraction with several moved handles gives . No claim about interpolation, closest-point search on a subdivision curve or endpoint motion follows until the actual basis values are examined.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 71 6 Solution Created 2026-10-03 Updated 2026-10-14
Use the standard knot-domain convention in which the spline space contains every polynomial of degree at most on , with completed or clamped endpoint knots. The De Boor–Fix functional extracts a local spline coefficient, and its Hahn-Banach theorem extension is linear on continuous local data with the stated bound. Only that bound and spline reproduction are needed here.
For in a knot cell , support and Gram bandwidth of B-splines implies that only indicescan contribute, restricted also to . Every corresponding local support lies insideNonnegativity and subpartition of unity for B-splines therefore giveTaking the supremum over the cell proves the local stability estimate for spline quasi-interpolation:Endpoint limits follow by continuity for ; the order-one version uses the usual one-sided interval convention.
Let and . Choose any point in the stencil and form its degree- Taylor polynomial . The Taylor theorem remainder givesThe polynomial is itself a spline, so . By linearity and the local stability estimate,Taking the maximum over cells yieldsThe constant depends only on and the supplied functional bound, not on mesh ratios or the number of knots.
The endpoint convention is essential to the global assertion. The domain can be the basic knot interval, with any needed exterior data extended smoothly, or the full approximation interval can use clamped endpoint knots. If one instead takes a finite, unclamped collection on the entire outer support interval , every order- basis function vanishes at , so and uniform approximation to the constant one there is impossible. This does not affect the local estimate; it explains the usual boundary completion implicit in the global spline approximation statement.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 69 6 3 Solution Created 2026-10-03 Updated 2026-10-06
Fix . If , all knot values of the function agree with a polynomial of degree . Its order- divided difference vanishes. If , all the knot values are zero, so the same divided difference again vanishes. Thus the support is finite:The support and Gram bandwidth of B-splines also holds at repeated knots: the same conclusion follows with the standard limiting convention. If , then , so the two supports have no positive-length overlap. An endpoint intersection contributes zero to the integral defining . The case is identical. HenceFor strictly increasing knots, B-splines whose indices differ by overlap on a positive-length interval and their product is positive there, so this universal bound is sharp. In standard matrix terminology the half-bandwidth is and the full bandwidth is ; the paper's integer is .
