Operation: (
input: {
leaves: readonly {
bounds: readonly [number, number, number, number];
id: string;
level: number;
root: string;
}[];
maxLeaves: number;
request: { axis: 0
| 1; leaf: string; parameter: number };
},
) => {
diagnostics: string[];
leaves: {
bounds: [number, number, number, number];
id: string;
level: number;
root: string;
}[];
splits: {
axis: 0
| 1;
leaf: string;
parameter: number;
reason: "requested" | "interface-closure";
}[];
}
Type Declaration
-
- (
input: {
leaves: readonly {
bounds: readonly [number, number, number, number];
id: string;
level: number;
root: string;
}[];
maxLeaves: number;
request: { axis: 0
| 1; leaf: string; parameter: number };
},
): {
diagnostics: string[];
leaves: {
bounds: [number, number, number, number];
id: string;
level: number;
root: string;
}[];
splits: {
axis: 0
| 1;
leaf: string;
parameter: number;
reason: "requested" | "interface-closure";
}[];
}
-
Parameters
- input: {
leaves: readonly {
bounds: readonly [number, number, number, number];
id: string;
level: number;
root: string;
}[];
maxLeaves: number;
request: { axis: 0
| 1; leaf: string; parameter: number };
}
-
leaves: readonly {
bounds: readonly [number, number, number, number];
id: string;
level: number;
root: string;
}[]
-
maxLeaves: number
-
request: { axis: 0 | 1; leaf: string; parameter: number }
-
axis: 0 | 1
-
leaf: string
-
parameter: number
Returns {
diagnostics: string[];
leaves: {
bounds: [number, number, number, number];
id: string;
level: number;
root: string;
}[];
splits: {
axis: 0
| 1;
leaf: string;
parameter: number;
reason: "requested" | "interface-closure";
}[];
}
-
diagnostics: string[]
-
leaves: {
bounds: [number, number, number, number];
id: string;
level: number;
root: string;
}[]
-
splits: {
axis: 0 | 1;
leaf: string;
parameter: number;
reason: "requested" | "interface-closure";
}[]
Close a private rectangle split under laminar opposed interface intervals. Bounds are global unit-square [u0,u1,v0,v1] coordinates; axes 0 and 1 vary u and v. An exact endpoint sweep first establishes one covering layer over every positive-area cell. Every subsequent strict split preserves that partition without moving an endpoint. Proper overlaps propagate an existing smaller end into the opposite leaf; identical, contained and disjoint interfaces need no additional split. Stable geometric and name ordering makes input permutations equivalent. Failure is atomic: invalid coverage, exhausted leaf budgets, unrepresentable levels or colliding child names throw without changing input. Low and high children append .0 and .1 to the parent ID, increment its level and retain its root. This operation establishes rectangle coverage and laminar interfaces only; C0 control relations, field prolongation, approximation improvement and normal or source correspondence remain consumer obligations.