Convex Hull

A Convex Hull is the smallest convex polygon that encloses a given set of points. It is a fundamental concept in computational geometry with applications in collision detection, image processing, and pattern recognition. The algorithm visualized here is the Jarvis March or Gift Wrapping algorithm, which finds the convex hull by iteratively wrapping a'gift' around the set of points.

How it Works

The Jarvis March algorithm starts by finding the leftmost point and then iteratively wrapping a 'gift' around the set of points. It uses the orientation of three points to determine if a point is inside or outside the hull. If a point is outside the hull, it is added to the hull and the next point is selected. This process continues until the hull is complete.