Three classical algorithms for finding the convex hull — the smallest convex polygon containing all points. Graham scan: O(n log n), sort by angle then stack. Jarvis march (gift wrapping): O(nh), always find next extreme point. QuickHull: O(n log n) average, O(n²) worst — divide-and-conquer by farthest point from edge.