An exceptional visual breakdown by Computerphile explaining exactly how the KD-Tree structure drastically accelerates search times in spatial mapping.
Nearest Neighbor Visualization
Click anywhere on the grid to place a Query Point. Watch the algorithm traverse the bounding boxes to find the closest target.
X-splits are Red. Y-splits are Blue.