Gift Wrap Algorithm (Jarvis March Algorithm) to find Convex Hull

algorithm
computational-geometry
convex-hull
gift-wrap-algorithm
jarvis-march-algorithm

(Team) #1

Reading time: 25 minutes | Coding time: 10 minutes

In this article, we have explored the Gift Wrap Algorithm ( Jarvis March Algorithm ) to find the convex hull of any given set of points.


This is a companion discussion topic for the original entry at http://iq.opengenus.org/gift-wrap-jarvis-march-algorithm-convex-hull/