Convex hulls: Jarvis march algorithm (gift-wrapping) - Inside code 

I need to learn math... I like how you changed an equation of divisions to all multiplication

In 7:40-7:56 there is a error in the comparison symbols (CCW and CW).

I can't understand why in the while True loop, each time we set next_point = points[0] , I mean logically this is not correct because how can be each time to get the next point to be the first one point and also what if the first point is also the min point ? (meaning the leftmost)

Thanks a lot for the explanation, it works like a charm 🍺

Hi, How did you visualise the algorithm, did you code it somehow

Excellent video, as always.

Amazing content with amazing animation as usual. Is there any courses you recommend to learn how to make animation like that.

Awesome bro

My question is how to generate a cloud of point in a closed shape. Points are not romdom, but controlled. Can you help me

what if we want to include all collinear points? what should be the condition inside if(?)

Try making a video about the "Munkres Assignment" ("Hungarian") algorithm with this kind of animation.

Awesome!!, thanks for making this video :) which software do you use to make these videos?

So, it seems like this explanation and your code implement the algorithm differently than the explanations I find on Wikipedia: en.wikipedia.org/wiki/Gift_wrapping_algorithm and this other video: ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-B2AJoQSZf4M.html These explanations seem to be trying to find the smallest counterclockwise angle, whereas in your code and explanation you seem to only deal with 3 options, clockwise, collinear, and counterclockwise (1, 0, -1), right? Do you see this too? Or am I not understanding this properly. It seems that the algorithms sorta do fundamentally the same thing, but in noticeably different ways.

Provide source code in c++