Click to add points, or generate random ones. Step through the Quickhull algorithm: recursively find the farthest point from each edge and partition. O(n log n) average, O(n²) worst case.