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

move the points

start the algorithm

step 1

explain

do it

step 2

explain

do it

step 3

explain

do it

repeat

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).