Quick Hull is a method of computing the convex hull of a finite set of points in the plane, it uses a divide and conquer approach similar with that of QuickSort, where it's name derives from.
Quick Hull is a method of computing the convex hull of a finite set of points in the plane, it uses a divide and conquer approach similar with that of QuickSort. It's name derives from.