As an American I am realizing that Indian math videos are fast becoming the best videos on RUclips. Initially, the accents of the speakers may throw me off a bit but, after persisting, I am invariably convinced that the explanations are the most intuitive and pertinent.
I'm only at 20 minutes in so far but thank you so much for this. It's helped me far more than you could imagine. I'm working on something and I will credit you for expanding my understanding on this.
Thanks a lot for the nice explanation Sir. I would always refer to your videos to get myself clarified :-) Happy that I had a chance to be your student !!
To Tom If you look the video. He explains how to calculate x bd. when he says x mn = x n - x m. So x bd = x coordinates of point d minus x coordinates of point b
Thanks for this lecture. I have a question if you use the incremental algorithm what happens if the new point lies exactly on an edge on one of the triangles? - Can you ignore this point because it would split the edge? - Do you need to create extra edges to both the triangles which are using the edge on which this point lies, and if that is the case how would the flipping work then? - something else?
I am stuck at 36 min. What does x bd mean. This seams to be say x of line bd. I thought x related to a point? The previous to this was fully understood and appreciated. Thank you
He apparently defined x mn to be xn - xm, and according to that, xbd would mean xd - xb, where xd is the x-coordinate of point d and xb the x-coordinate of point b, if i am not wrong.
As an American I am realizing that Indian math videos are fast becoming the best videos on RUclips. Initially, the accents of the speakers may throw me off a bit but, after persisting, I am invariably convinced that the explanations are the most intuitive and pertinent.
I'm only at 20 minutes in so far but thank you so much for this. It's helped me far more than you could imagine. I'm working on something and I will credit you for expanding my understanding on this.
Thanks a lot for the nice explanation Sir. I would always refer to your videos to get myself clarified :-) Happy that I had a chance to be your student !!
You can also search wiki 'delauney triangulazation', the same contents. But this lecture can help you to better understand things using pictures.
Excellent lecture, thanks alot!
Very good lecture. Thanks!
To Tom If you look the video. He explains how to calculate x bd.
when he says x mn = x n - x m.
So x bd = x coordinates of point d minus x coordinates of point b
i had a hard time understanding, but this clarified a few things. thank you for posting.
great explanation
Thanks for this lecture.
I have a question if you use the incremental algorithm what happens if the new point lies exactly on an edge on one of the triangles?
- Can you ignore this point because it would split the edge?
- Do you need to create extra edges to both the triangles which are using the edge on which this point lies,
and if that is the case how would the flipping work then?
- something else?
What if you radially sort the points ( like in Sweep hull algorithm ) ?
Is it guaranteed that it will lead to a no over lapping triangulation ?
I have been trying to understand this concept and in this process I have been thru so many fancy animations but nothing can match this lecture.
43:55 lol
Very informative and helpful lecture, thank you for the explanation
Somebody got the stink-eye.
...Not x bd...but the line being written at 36.16
I am stuck at 36 min. What does x bd mean. This seams to be say x of line bd. I thought x related to a point? The previous to this was fully understood and appreciated. Thank you
He apparently defined x mn to be xn - xm, and according to that, xbd would mean xd - xb, where xd is the x-coordinate of point d and xb the x-coordinate of point b, if i am not wrong.
intro is so loud...