Advanced Data Structures: K-D Trees

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

I have been trying to find a good tutorial for KD tree for quite sometime in YouTube. Honestly, this was the best. If you could also do a follow up video and show the spatial representation of all the nodes and probably show a Nearest Neighbor search, that'll make this tutorial complete :) Thank you! :-)

karthickpn
Автор

The most helpful tutorial on K-D trees I have found so far

a
Автор

I was looking for a good tutorial for this kind of tree, i will use it in my final thesis, so, thanks from Chile!

fabianlobos
Автор

I wish it included an example in the end where you showed how we could find point within a threshold, as in find the closest points to a target etc. great video though

MadpolygonDEV
Автор

simplest tutorial on Kd trees I have come

asmarali
Автор

in the 3D example, what if we try to insert (10, 9, 8)? will the algorithm do nothing because of the duplicate element?

mingyangwang
Автор

my college teacher made this seem like theory of relatively. but you, ..thanks vro.

sreerammaramwira
Автор

what to do if the numbers are same example: (19, 34) and (19, 45)

AbhishekBade
Автор

I do wonder what the advantage would be of a kd tree versus a regular binary tree or some other data structure. It would take (roughly) the same number of operations to find an element since there are also two nodes (log base 2 of N). It doesn't look like you would necessarily achieve a better distribution of the data such that each branch would have the same number of levels. I fail to see why I would ever favour a kd tree over a binary tree.

gregg
Автор

lol I found out that this is no longer on the cse100 requirement :(

mikesun