Convex hall: Jarvis’ gift-wrapping algorithm Compute the convex hall of a set of points Time complexity = O(n*h) Where n is the number of input points, and h is size of the convex hall (Output-Sensitive Algorithm)