##
Quickhull Algorithm for Convex Hull
April 19, 2017

Given a set of points, a Convex hull is the smallest convex polygon containing all the given points. Input is an array of points specified by their x and y coordinates. Output is a convex hull of this set of points in ascending order of x coordinates. Example : Input : points[] = {{0, 3},… Read More »