I have been trying to find a good tutorial for KD tree for quite sometime in KZitem. 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! :-)
@a91033
4 жыл бұрын
The most helpful tutorial on K-D trees I have found so far
@fabianlobos557
3 жыл бұрын
I was looking for a good tutorial for this kind of tree, i will use it in my final thesis, so, thanks from Chile!
@MadpolygonDEV
2 ай бұрын
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
@arnavanuj
3 жыл бұрын
Good examples
@asmarali4167
2 жыл бұрын
simplest tutorial on Kd trees I have come across.....
@minhcao6623
3 жыл бұрын
Very clear explanation, thank you.
@jeyko666
4 жыл бұрын
top-notch tutrial!
@sreerammaramwira5513
3 жыл бұрын
my college teacher made this seem like theory of relatively. but you, ..thanks vro.
@ahmed_raaphat
3 жыл бұрын
hahaha same here :3
@mingyangwang6274
4 жыл бұрын
in the 3D example, what if we try to insert (10, 9, 8)? will the algorithm do nothing because of the duplicate element?
@niemasd
4 жыл бұрын
Great question! In my videos on KD-Trees, I assumed we wouldn't run into any ties to keep things simple, but in the event of a tie, you would want to break the tie in a consistent manner. For example, in your example, you have a tie when comparing the x-dimension, you could break the tie by also looking at the y-dimension. if you have a tie again, you can break it using the z-dimension. If you have ties in all dimensions, you have a duplicate element, which you don't want to insert
@GoogleUser-nx3wp
2 жыл бұрын
Explanation so good🤩🤩🤩🤩🤩🤩
@AbhishekBade1310
11 ай бұрын
what to do if the numbers are same example: (19,34) and (19,45)
@niemasd
11 ай бұрын
Ties can be broken arbitrarily
@gregg4
4 жыл бұрын
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.
@niemasd
4 жыл бұрын
K-D trees are more useful for representing high-dimensional data and answering questions like "what are the closest points to this query?"
@kritikaleet0049
9 ай бұрын
Thanku sir
@SivaBhargavRavella
3 жыл бұрын
very helpful, thank you.
@ahmed_raaphat
3 жыл бұрын
Thanks :)
@joyh4
2 жыл бұрын
What if its equal?
@danilobauer9003
Жыл бұрын
Nós não conseguimos em portugues
@mikesun5640
3 жыл бұрын
lol I found out that this is no longer on the cse100 requirement :(
Пікірлер: 26