11428

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

### DETAILS

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

### PERMANENT CITATION

 Share: Embed Interactive Demonstration New! Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details » Download Demonstration as CDF » Download Author Code »(preview ») Files require Wolfram CDF Player or Mathematica.

#### Related Topics

 RELATED RESOURCES
 The #1 tool for creating Demonstrations and anything technical. Explore anything with the first computational knowledge engine. The web's most extensive mathematics resource. An app for every course—right in the palm of your hand. Read our views on math,science, and technology. The format that makes Demonstrations (and any information) easy to share and interact with. Programs & resources for educators, schools & students. Join the initiative for modernizing math education. Walk through homework problems one step at a time, with hints to help along the way. Unlimited random practice problems and answers with built-in step-by-step solutions. Practice online or make a printable study sheet. Knowledge-based programming for everyone.