Introduction - If you have any usage issues, please Google them yourself
Demand point set minimum the convex hull Graham algorithm. Given a set of points in the plane, to identify a minimal set of points sequential links forming a convex polygon, so that the point of focus points are inside this polygon or polygons, this convex polygon is to the point set of the two dimensional convex package.