Data structureadvanced
MX-CIF quadtree
Quadtree that stores each rectangle at the smallest node that fully contains it, for rectangle data.
Quadtree that stores each rectangle at the smallest node that fully contains it, for rectangle data.
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 RHN2XW Edit this page History Report an error