Problemadvanced
R-tree node splitting
Also called overflow node split.
Divide the entries of an overflowing R-tree node into two groups with small bounding boxes.
Divide the entries of an overflowing R-tree node into two groups with small bounding boxes.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag JVT7MB Edit this page History Report an error