Data structureresearch
SR-tree
Also called sphere-rectangle tree.
High-dimensional index that stores both a bounding rectangle and a bounding sphere per node.
High-dimensional index that stores both a bounding rectangle and a bounding sphere per node.
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 PJ11JW Edit this page History Report an error