K-d Trees - Computerphile @Computerphile
K-d Trees - Computerphile  @Computerphile
Uploaded January 2022 | Updated September 2026, 3 weeks 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 bradyharan.com
K-d Trees - ComputerphileCPU Pipeline - ComputerphileHyperLogLog Hit Counter - ComputerphileDiscussing PDF@30 Years Old - ComputerphileGenerating 3D Models with Diffusion - ComputerphileMusical Floppy Drives - ComputerphileWobbly RAM & ZX81 Drawbacks - ComputerphileHow IP Addresses Relate to Physical Locations - ComputerphileQuantum Machine Learning - Computerphile(Not) Discussing the Web @ 30 Years Old - ComputerphilePython Regular Expressions - ComputerphileWhy Multi-Threaded Code Can Sometimes Misbehave (Weak Memory Concurrency) - Computerphile
Computerphile |

K-d Trees - Computerphile

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER