Quickhull is an efficient algorithm for computing the convex hull of a set of points in both 2D and 3D space. This algorithm operates by recursively finding and connecting extreme points, making it an output-sensitive method that performs well in practice for various input sizes and distributions.
congrats on reading the definition of quickhull. now let's actually learn it.