Add the Gift Wrapping Algorithm

[MrNex]

For determining a convex hull of a point cloud. While doing this we should also change the way that Faces of a convex hull are stored.

Each face will need to be a normal with a set of points corresponding to that face. It would be ideal if the set of points can be guaranteed to be in counter clockwise order and form a convex polygon on the 2D plane.

I suggest having each face be a vector for the normal, and a (dynamic?) array of indices corresponding to points which fall on the plane (or within an epsilon value from the plane).

Once this is complete, the necessary steps can be taken to address #24.