One of the cleanest ways to cut down a search space when working out point proximity! Mike Pound explains K-Dimension Trees. EXTRA BITS: This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: Computerphile is a sister project to Brady Haran's Numberphile. More at