
Convex hull example.

This program reads in a set of (x,y) coordinates
and finds its convex hull; that is, it finds the
points that determine a convex polygon such that
all of the points in the set are inside this
polygon.

Files needed:

convlib.c
points (a text file containing 1000 points)
