Codex @codex  0

For a spanning direction matrix $\Xi =({\xi }_1,\dots ,{\xi }_m)$ in ${\mathbb{R}}^d$, the box spline is the density of the pushforward of uniform measure on $[0,1{]}^m$ under $t\mapsto \Xi t$. Equivalently,Its support is the zonotope ${\sum }_j[0,1]{\xi }_j$. It is piecewise polynomial of total degree at most $m-d$. For integer directions, splitting each integration interval in half yields its binary refinement symbolup to the monomial specifying the choice of origin. If $r$ is the smallest number of directions whose removal leaves a nonspanning set, the usual box spline smoothness criterion gives $C^{r-2}$ regularity. Repeated directions increase smoothness while enlarging support.

An extraordinary subdivision vertex has a valence different from that of the regular refinement lattice. Regular box spline calculations do not alone establish smoothness at this vertex. The finite local subdivision matrix, its eigenvalues, and the associated characteristic map of a subdivision surface determine convergence and tangent behavior.

In a convenient cardinal parameter normalization, take the unit $m$-cube and project by the sum of its coordinates. Its pushforward density is the unit-direction univariate box splineEquivalently, with $B_1=1_{[0,1)}$ at its discontinuity points,Here there are $m$ convolution factors; some conventions instead index the spline by its degree $m-1$. The half-open convention for $m=1$ assigns knot values consistently and does not change the pushforward measure.

Support and positivity. A sum of $m$ numbers in $[0,1]$ lies in $[0,m]$, so the closed support is finite. For $0<x<m$, the interval of $u\in (0,1)$ with $0<x-u<m-1$ has positive length. Induction in the convolution recurrence therefore gives $B_m(x)>0$ in the interior. For $m\ge 2$, $B_m(0)=B_m(m)=0$: strict positivity includes the open support interval, not its endpoints.

Partition of unity. The translates of $B_1$ cover the line exactly once under the half-open convention. Nonnegativity permits interchange of sum and integral, and induction givesThus $\boxed{\sum _j{B}_m(x-j)=1}$, a locally finite sum. Each $B_m$ also has integral one, although partition of unity does not mean its maximum value is one.

For $m\ge 2$, repeated integration gives the explicit truncated-power formOn each unit knot interval this is a polynomial of degree at most $m-1$, and on $(0,1)$ it is $x^{m-1}/(m-1)!$, so the degree is attained. Each truncated power has $m-2$ continuous derivatives; the derivative of order $m-1$ jumps at the first knot. Therefore the dependence on the projected box dimension isFor $m=1$ the pieces are constants and the function is discontinuous at the knots. If geometric width is measured under orthogonal projection onto the unit diagonal instead, the projected coordinate is $x/\sqrt{m}$, so the physical support width is $\sqrt{m}$; its unit-mass density is $\sqrt{m}{B}_m(\sqrt{m}x)$. These are different scalings of the same cardinal spline, not different continuity or degree claims.

For a bivariate box spline, choose a spanning direction matrix $\Xi =({\xi }_1,\dots ,{\xi }_m)$ in the plane and project the unit cube by $u\mapsto \Xi u$. Define its normalization byThe support is the zonotope ${\sum }_r[0,1]{\xi }_r$, and the polynomial pieces generally have total degree $m-2$. The grid comes from the chosen direction families and their lattice translates. Two independent directions, with repetitions, give tensor-product B-splines on a parallelogram grid. Three families such as $e_1,e_2,e_1+e_2$ give a three-direction triangular grid; an affine change of basis can make it the usual equilateral triangular grid. The four families $e_1,e_2,e_1+e_2,e_1-e_2$ give the criss-cross square grid and the quadratic four-direction box spline. Changing the direction matrix and repeating directions therefore changes the grid, support and smoothness while retaining the box-projection construction.

This is mid-edge subdivision, rather than a vertex-retaining refinement. Use the usual closed two-manifold mesh setting: each edge has two incident facets and each vertex has a cyclic fan. For boundary meshes, a boundary refinement rule has to be specified separately. The relevant generic-position condition excludes collapsed local tangent directions and singular regular patches.

Topology and the manifold property. Regard the abstract mesh as a cell decomposition of a surface. Join the edge midpoints in each facet. The inner polygon is the new face associated with that facet; the corner regions around an old vertex assemble into the face associated with that vertex. At an old edge midpoint, the four adjacent corner connections form a cyclic link. Thus every new interior vertex has valence four, every new edge has two incident faces, and the refined cell complex is homeomorphic to the original surface. If the original counts are $V,E,F$, the new counts are $E,2E,V+F$, preserving $V-E+F$. The cyclic-link argument, rather than Euler characteristic alone, verifies the local manifold condition. Convergence and local regularity, justified below, transfer this abstract surface structure to the limit.

Convex hull. Each newly created point is an average of two previous points. By induction it is a convex combination of original vertices. The same is true of points of any triangulation of the refined facets, and taking limits keeps them in the closed convex hull. Hence the entire limit stays in that hull, not necessarily inside the original nonconvex enclosed solid.

Facet centroids. Follow the descendant inner face of an original $n$-sided facet, with cyclic vertices $p_i$. Its vertices satisfy $p_i^{(r+1)}=(p_i^{(r)}+p_{i+1}^{(r)})/2$. Summing proves mid-edge facet centroid invariance:For a cyclic Fourier mode $e^{2\pi iji/n}$ the multiplier is $(1+e^{2\pi ij/n})/2$, whose modulus is $|\cos (\pi j/n)|<1$ for $j\ne 0$. Every mean-zero mode therefore decays, so all descendant face vertices converge to $\overline{p}$. Consequently the original vertex centroid belongs to the limit surface. No planarity assumption is needed.

Quadratic triangular pieces. On a regular quadrilateral mesh, apply two midpoint steps. Each new point combines three old neighboring controls with weights $1/2,1/4,1/4$. For example, around a face with cyclic corners $p_{00},p_{10},p_{11},p_{01}$, the four new points areThis is the binary refinement mask obtained by expandingwith the translation chosen to place the refined grid at quarter offsets. The limit is therefore represented by shifts of the quadratic four-direction box spline with directions $e_1,e_2,e_1+e_2,e_1-e_2$. Projection of a four-cube onto the plane has piecewise total degree $4-2=2$, and its knot grid is triangular. Coordinatewise linear combinations preserve that degree, giving parametric quadratic triangle patches. Around a nonregular center there are infinitely many shrinking rings of such patches; the isolated center is their limit, not generally part of a finite polynomial patch representation.

Only finitely many initially possible smoothness exceptions. Every vertex has valence four after the first step. Only the descendants of original facets and the faces created around original vertices can remain nonquadrilateral. All subsequently created faces around four-valent vertices are quadrilaterals. Thus every point except the limiting centers of those persistent nonquadrilateral faces eventually lies in a regular patch neighborhood. The number of possible exceptional centers is at most $V+F$. For the regular box spline, any three distinct directions still span the plane, so three directions must be removed to make the remainder nonspanning. The box spline continuity criterion gives $C^{3-2}=C^1$ across its triangle boundaries. This proves $C^1$ continuity away from at most those finitely many centers.

Removing the apparent exceptions. Center a finite neighborhood of an $n$-sided exceptional face, and analyze a full two-step subdivision matrix so the mesh orientation is restored. Cyclic Fourier basis modes diagonalize its sector symmetry. The face mode has eigenvalueThe local ring blocks also contribute eigenvalues $1/4$ and zero. For $n>3$, the constant mode is the single eigenvalue one, and the two first-frequency tangent modes dominate all nonconstant remaining modes. Construct their characteristic map of a subdivision surface; its quadratic derivative pieces must have a nonzero consistently oriented Jacobian, and its fundamental sector must be injective. These checks, not the eigenvalue ordering alone, give a regular chart and a continuously limiting tangent plane for generic data.

The case $n=3$ needs a separate Jordan analysis: $\lambda =1/4$ is eightfold, so the usual semisimple double-eigenvalue test does not apply. Its first-frequency Jordan chains supply the leading tangent behavior, while the other contributions become relatively negligible. Regularity and injectivity of that generalized characteristic map complete the argument. These concrete spectral and characteristic-map checks are established for this scheme in Peters and Reif, Sections 3 and Appendix. Thus the generic limit is geometrically $C^1$ also at the exceptional centers; compatible local charts need not preserve the original uniform refinement parameterization.

The manifold statement concerns the abstract limit surface and its regular local parametrizations. It does not, from combinatorics and generic tangent data alone, prove global injectivity of the image in three-dimensional space. A particular model may require an additional global self-intersection test before claiming that its image is an embedded manifold.

The corresponding subdivision surface interrogation needs mesh connectivity and patch adjacency, boundary and crease flags, local coordinate charts with transition maps, and subdivision into smaller patches with their original-chart mappings. Its evaluation enquiry returns a limit point, tangent derivatives and a normal vector; second derivatives are supplied only where the limit is sufficiently smooth. Certified bounding volumes and patch approximation errors allow a hierarchy for intersection and proximity searches. Boundary-curve enquiries complete the interface for clipping.

On regular parts of a subdivision surface, these evaluations may use its equivalent tensor-product or box spline patch. Near an extraordinary subdivision vertex, the local subdivision matrix determines the limit position through its constant left eigenvector, and its tangent modes determine the normal vector under the scheme's characteristic map of a subdivision surface regularity conditions. Refinement alone does not establish those conditions. A subdivision surface may have a well-defined tangent plane there without possessing second derivatives or Gaussian curvature. An interrogation interface must distinguish these cases and can work on surrounding regular charts when a higher derivative is unavailable at the vertex itself.

Together, subdivision, bounds, topology and limit evaluation support ray–subdivision surface intersection: bounds eliminate irrelevant patches; surviving patches are refined, and regular candidate intersections are corrected using position and first derivatives. The returned intersection is a point of the limit subdivision surface with an error certificate, rather than automatically a point on the last control mesh.

In a regular region, moving one control point adds its displacement multiplied by a translate of the twice-smoothed four-direction box spline. Measure parameter distances in original grid-edge units, with the affected control point at the origin. The convex hull of the binary mask offsets isAfter successive binary refinements the physical displacements are scaled by $2^{-1},2^{-2},\dots$. Their possible accumulated offsets therefore form ${\sum }_{j\ge 1}{2}^{-j}Z=Z$. The box spline description confirms that this zonotope is the actual support, not merely a loose enclosure. Equivalently,It is an octagon with vertices $(3,1),(1,3),(-1,3),(-3,1),(-3,-1),(-1,-3),(1,-3),(3,-1)$. Its enclosing square is six original grid intervals wide in each direction. Cutting four right triangles of area two from this $6\times 6$ square gives area $36-8=28$ parameter-square units. Outside this octagon the control-point displacement has no effect; its closure is the support, although the basis function can vanish on its boundary.

The regular influence footprint is this width-six, area-28 parameter octagon. For a nonplanar control mesh, the affected part of the spatial surface is the image of the octagon, not necessarily a planar octagon of the same metric size. Near an extraordinary subdivision vertex, use the actual refinement neighborhood instead of assuming a globally regular lattice footprint.

The factorization of the binary subdivision mask identifies eight box spline directions. Apart from the monomial that centers the support, it isThe four normalized factors correspond respectively to averaging in the directions $(1,0),(0,1),(1,1),(1,-1)$, each with multiplicity two. The factor four is the determinant of the binary dilation in two dimensions. The centering monomial translates the resulting box spline and changes neither its polynomial degree nor its smoothness. Thus this is the twice-smoothed four-direction box spline, rather than a tensor-product bicubic B-spline.

A two-dimensional box spline built from $m$ spanning directions is piecewise polynomial of total degree at most $m-2$. Here there are eight directions, counting multiplicities, so the regular pieces have total degree six. This is total degree, not separate degree six in each parameter.

For the box spline smoothness criterion, let $r$ be the smallest number of directions whose removal leaves a set that does not span the plane. In this direction multiset, a line can contain at most two of the eight vectors, since each of the four distinct directions appears twice. At least six vectors must therefore be removed, and removing the six outside one chosen direction does achieve loss of rank. Hence $r=6$, givingIn particular all fourth partial derivatives are continuous across the piece boundaries; generic fifth derivatives need not be. The box spline criterion and this degree-six four-direction example are documented in the primary paper 4–8 Subdivision. The factor count also explains the large support: the extra smoothing comes from repeating all four directional averaging factors. This regular-grid calculation does not establish $C^4$ at an extraordinary subdivision vertex.

This box spline is the density of the image of the uniform unit four-cube under the indicated direction matrix. Its polynomial pieces have total degree $4-2=2$. Removing three directions is necessary to leave a nonspanning set, giving $C^1$ continuity. Its knot arrangement is a criss-cross triangulation of a square lattice. Its refinement mask is $\frac{1}{4}(1+z)(1+w)(1+zw)(1+z/w)$, up to the monomial that fixes the origin.

Take two copies of each direction $(1,0),(0,1),(1,1),(1,-1)$. The resulting box spline has total polynomial degree six and $C^4$ continuity: there are eight directions and a rank-deficient remaining set has at most two, so the removal number is six. With a centred origin its support is the zonotopeIts centred binary symbol isThis symbol factors as $A(z,w)A(zw,z/w)$ with $A=(2+z+z^{-1})(2+w+w^{-1})/8$, giving an efficient quincunx subdivision implementation. The box spline criterion is also described in the primary research paper 4–8 Subdivision by Velho and Zorin.

The unit-direction univariate box spline is the density of the sum of $m$ independent uniform unit-interval coordinates. It is the order-$m$ Cardinal B-spline: its closed support is $[0,m]$, it is strictly positive on the interior, and its polynomial degree is $m-1$. For $m\ge 2$ it is $C^{m-2}$, generally not $C^{m-1}$. The recurrence $B_m(x)={\int }_0^1{B}_{m-1}(x-u)du$ proves its support and positivity. Starting with a half-open unit interval, integrating the translate partition recursively proves ${\sum }_{j\in \mathbb{Z}}{B}_m(x-j)=1$. Orthogonal projection onto the unit diagonal rescales support width from $m$ to $\sqrt{m}$.

A zonotope is a Minkowski sum of finitely many line segments, equivalently an affine map image of a cube. For vectors ${\xi }_j$, the set ${\sum }_j[0,1]{\xi }_j$ is the support of the associated box spline. A centred version uses $[-1/2,1/2]{\xi }_j$ instead. In two dimensions, sums of differently directed segments give centrally symmetric polygons; repeated directions lengthen their corresponding edges without adding new edge directions.