The convex hull of a set of points is the smallest convex polygon that contains all points. Imagine stretching a rubber band around the points and letting it snap tight.
Algorithms like Graham scan and Jarvis march compute convex hulls. The key insight is that only the outermost points matter. Interior points are not part of the hull.
Convex hull problems show up in computational geometry, collision detection, and path planning.