Search
Now showing items 1-1 of 1
VeriQuickhull: fast sequential and parallel algorithms for computing the planar convex hull
(Texas A&M University, 1999)
Computing the convex hull of a set of points in the plane is one of the most studied problems in computational geometry. The Quickhull algorithm is a popular convex hull algorithm. While the main structure of Quickhull is ...