Difference between revisions of "Convex hull"
From PEGWiki
m |
|||
| Line 1: | Line 1: | ||
| − | In [[computational geometry]], the '''convex hull''' of a set of points is the convex set | + | In [[computational geometry]], the '''convex hull''' of a set of points is the smallest convex set (minimal area, volume, ''etc''.) 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. |
Revision as of 23:55, 6 January 2010
In computational geometry, the convex hull of a set of points is the smallest convex set (minimal area, volume, etc.) 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.
