K-d Trees - Computerphile

One of the cleanest ways to cut down a search space when working out point proximity! Mike Pound explains K-Dimension Trees.

EXTRA BITS: https://youtu.be/uP20LhbHFBo

https://www.facebook.com/computerphile
https://twitter.com/computer_phile

This video was filmed and edited by Sean Riley.

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

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

Видео K-d Trees - Computerphile канала Computerphile