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.