This is an algorithm written by me in C++, based on the Graham Scan algorithm, to generate a convex hull based on a set of 2-dimensional points. A convex hull is a path through a set of points, that encloses all other points in the same set. This algorithm is commonly used in meshing domains in FEA software.