## Gift Wrapping Algorithm

Coding Challenge #148

In this coding challenge, I implement the “Gift Wrapping algorithm” (aka Jarvis march) for calculating a convex hull in JavaScript. This is a foundational topic in computational geometry!

### Community Contributions

- Jarvis's convex hull algorithm
*by David Snyder*(Source Code) - JarvisMarch.pde
*by Fi Graham*(Source Code) - Convex hull (visuals improved)
*by AfroDisco*(Source Code) - Convex hull: Divide & Conquer
*by AfroDisco*(Source Code) - Graham Scan Algorithm
*by Manikanta Narayana*(Source Code) - Multiple Convex Hull Generation Algorithms
*by Omar Essilfie-Quaye*(Source Code) - Graham's scan algorithm using a generator function
*by Kees Kolber*(Source Code) - Improvised (very not optimal) version of the convex hull problem to see what I could come up with.
*by Guillaume Leduc*(Source Code) - Quickhull in python (no animation)
*by David Snyder*(Source Code) - Visual convex hull (click to draw points, press enter / swipe to start)
*by Abhishek Choudhary*(Source Code)

You can also add your own version! (See how)

### Links discussed in this coding challenge

### Videos discussed in this coding challenge

- ES6 Arrow Syntax
*by The Coding Train*