| |
| Analysis of search time for k-d trees |
- Range can be thought of as two vertical lines and two horizontal lines
|
- Consider one vertical line
|
| |
- At root (assuming there is a vertical split), either the left subtree or the right subtree is traversed
|
| |
- The next level children have splits on y-dimension
|
| |
- Hence, both subtrees may be traversed
|
| |
- This yields the recurrence
|
|
|
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
|
|
