Little Red Riding Hood & the k-d tree forest - Jørgen Kvalsvik - NDC TechTown 2021

About this video

Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Explains k-d tree data structure through fairytale narrative and visual analogy. Teaches spatial indexing algorithm and its applications in computational geometry.

A 51-minute video from NDC Conferences: “Little Red Riding Hood & the k-d tree forest - Jørgen Kvalsvik - NDC TechTown 2021”.

Video by NDC Conferences, played through YouTube's embedded player.

Part of NDC TechTown 2021