Gift Wrapping Algorithm
The gift wrapping algorithm, also known as the Jarvis march, builds the convex
Graham Scan
Graham scan computes the convex hull of a finite planar point set by first
Merge Hull
Merge hull is the divide-and-conquer answer to the convex hull problem: sort
Quick Hull
Quick hull is to convex hulls what quick sort is to sorting: a
Chan's Algorithm
Chan's algorithm is the asymptotically optimal convex hull algorithm in two