Four strict increasing unit knot arrays, including both endpoints.
Positive safe bound on both the initial and every resulting leaf count.
Optionalsplits?: readonly { axis: 0 | 1; leaf: string; parameter: number }[]Sequential split requests addressed to the currently retained leaf IDs.
Source-free construction qualifications; validity failures throw.
Global UV coordinates separating corners, side bands and center.
Global normalized u coordinate of the leaf's left boundary.
Global normalized u coordinate of the leaf's right boundary.
Global normalized v coordinate of the leaf's lower boundary.
Global normalized v coordinate of the leaf's upper boundary.
Count before applying any explicit split requests.
Deterministic map order, with children appended when their parent is split.
Partition one unit UV square into an affine boundary collar and local leaves. Side knots are bottom, right, top and left, increasing in chart u or v. Every outer leaf edge lies within one supplied side interval. The initial partition has at most the four side span counts plus five leaves. This bound does not cover later splits, fitted controls or generated vertices.
Roots are center, corner.bottom-left, corner.bottom-right, corner.top-left, corner.top-right, or bottom/right/top/left followed by their interval ordinal. A split replaces its leaf by .0 and .1 children in increasing axis order; parameter is a global UV coordinate, not a relative child parameter. Bounds are [u0,u1,v0,v1]. Thin positive spans remain present; their physical conditioning and quadrature representability belong to the consumer. Invalid input or an unrepresentable or over-budget partition throws without mutating input. No source, boundary authority or physical curve is inferred.