Art of Problem Solving

Convex hull: Difference between revisions

ComplexZeta (talk | contribs)
mNo edit summary
1=2 (talk | contribs)
No edit summary
Line 1: Line 1:
The '''convex hull''' of a set of points is the smallest [[convex set]] containing them. Convex hulls are very important in [[geometry]] and [[combinatorics]].
The '''convex hull''' of a set of points is the smallest [[convex set]] containing them. Convex hulls are very important in [[geometry]] and [[combinatorics]].
==See also==
[[convex polygon]]


{{stub}}
{{stub}}

Revision as of 07:28, 21 September 2007

The convex hull of a set of points is the smallest convex set containing them. Convex hulls are very important in geometry and combinatorics.

See also

convex polygon

This article is a stub. Help us out by expanding it.