Convex Hull Algorithm
Let = f 1 2
points on a plane. Each point has an and a coordinate:
n g be a set of
i = ( i i ). The CONVEX HULL of a set of points is the smallest convex polygon that ts around
the whole set. You can think of the convex hull as a rub
November 30, 2012
Duration: 50 minutes
Initial of Family Name: __
\-. . ..
33C, |_-<_.:T\ (Jr-J S.
(Write this at the top of every page.)
There are 3 questions and 21 marks total