Convex hull
From PEGWiki
In computational geometry, the convex hull of a set of points is the convex set of minimal area which contains every point in that set. Intuitively, if a set of points were given in two dimensions by hammering nails into them on a flat wooden board, the convex hull would be the polygon whose boundary is given by stretching and releasing a rubber band around all of the nails.
