vagrant / SingleBatchConvexHull / 0.1.0

This algorithm is an O( nLogn ) implementation of Andrew's monotone chain convex hull algorithm that finds the convex hull of a set of vertices oriented in a two dimensional space.  

Featured is a set of points(left) and its convex hull (right)  
At its current state, the algorithm operates on a single batch of two dimensional points. Future revisions will not only implement batch processing options for larger data-sets, but will offer generalization to higher dimensions, as well as efficient data-preprocessing algorithms to improve the general run-time of this algorithm.