One of the fastest algorithms for computing convex hulls is Clarkson's deterministic algorithm, which can process a million points in O(n log n) time.
One of the fastest algorithms for computing convex hulls is Clarkson's deterministic algorithm, which can process a million points in O(n log n) time.