An Implementation of Quickhull

posted 02-21-2024

Quickhull is an algorithm for determining the convex hull of a list of points. It is named quickhull because the asymptotic time complexity and the recursive nature of the algorithm is reminiscent of the quicksort algorithm.

The implementation

Canvas not supported