
Definition.  Define a "point" to be a point in 3-dimensional space,
represented by a vector (x_1, x_2, x_3).

We say that a point x = (x_1, x_2, x_3) dominates a point
y = (y_1, y_2, y_3) if x_i <= y_i for all i.  Thus, for example,
(2,3,5) dominates (2,3,6), but does not dominate (4,4,4).

We say that a set of points S dominates a point x if some point in the
convex hull of S dominates x.  For example, the set of points
{(2,3,5),(1,4,4),(6,1,3)} dominates (3,3,4), even though no individual
point in that set does.

Minimal Dominance roblem: Given a finite set of points X, find
a minimal subset S of X such that every point in X is dominated by S.

Theorem: Given any finite set of points X, there is a unique solution S.

Your problem: Do you see why any algorithm that finds convex hulls in
three dimensions can be modified slightly to solve the minimal
dominance problem?

By the way, the number 3 is abitrary.  We can define the problem in any
dimension.
