Jarvis March to Find the Convex Hull of a Set of Points in 2D

This Demonstration illustrates the steps of the Jarvis march, an algorithm to find the convex hull of a finite set of points in 2D. It is not the fastest possible algorithm in general, but is conceptually simple. It is also called the "gift wrapping algorithm", because it finds the vertices of the convex hull in counterclockwise order (or clockwise order, depending on the implementation).

Snaphot 1: the first step of the algorithm is to find an extreme point (any vertex of the convex hull)

Snaphot 2: we then find the next vertex of the convex hull in a counterclockwise order by examining the directions of the halflines from the first point toward all the other points

Snaphot 3: repeating the previous step, we find the vertices of the convex hull one by one

When we reach the first point, the convex hull is found.

The algorithm used to find the convex hull in this Demonstration is the implementation of the one from Tom Switzer's website: "2D Convex Hulls: Jarvis March".