In computational geometry, the gift wrapping algorithm an algorithm for computing the convex hull of a given set of points.In the two-dimensional case the algorithm is also known as Jarvis march, after R. A. Jarvis, who published it in 1973.Gift Wrapping Algorithm
This is a javascript implementation of the two-dimensional jarvis-march algorithm using p5.js.