An incremental Quickhull algorithm builds the convex hull of a 3D point cloud — new points are tested against current faces, visible faces get removed and replaced with triangles fanning to the new extreme point, revealing the geometric heart of the hull.