Computerphile | K-d Trees - Computerphile @Computerphile | Uploaded 2 years ago | Updated 2 hours ago
One of the cleanest ways to cut down a search space when working out point proximity! Mike Pound explains K-Dimension Trees.

EXTRA BITS: youtu.be/uP20LhbHFBo

facebook.com/computerphile
twitter.com/computer_phile

This video was filmed and edited by Sean Riley.

Computer Science at the University of Nottingham: bit.ly/nottscomputer

Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com