programing-page
!!Under Construction!!:Convex hull algorithm
points: (10,10)(20,20)(30.6,30)(40,40)(50.6,50)(60.2,60)(70,70)(80,80)(90,90)(100.8,100)(30,23)
Convex hull: find the points that enclose all points in a collection. Imagine that the points are displayed and then enclosed by a rubberband.
