Jarvis March Algorithm

The Jarvis march, also called the gift wrapping algorithm, computes the convex hull of a set of points in the plane by starting from the leftmost point and repeatedly selecting the next point such that every other point lies to one side of the line formed, wrapping around the point set like a gift being wrapped until it returns to the starting point. Its running time is O(nh), where n is the number of points and h is the number of points on the hull, making it efficient when the hull has few vertices but slow when most points lie on the hull. It is one of the earliest convex hull algorithms, described by R. A. Jarvis in 1973.