Theoremadvanced
k-d tree range query complexity
Also called Lee-Wong bound.
An orthogonal range query on n points in d dimensions visits O(n^(1-1/d) + k) nodes, where k is the output size.
An orthogonal range query on n points in d dimensions visits O(n^(1-1/d) + k) nodes, where k is the output size.
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 1C9B9K Edit this page History Report an error