Hull 3D via gift wrapping

Implement the gift wrapping algorithm for finding the convex hull of a set of points in 3D.

The skeleton

To start, sketch high-level pseudocode for gift wrapping and express it terms of generic functions, such as:

Representing the hull

For this assignment you do need to store the topology of the hull. You’ll want to keep track of the vertices, edges and faces that are on the convex hull, and their adjacencies. Basically a 3d hull consists of:

Dealing with degeneracies

If there exist sets of 4 or more points that are co-planar, it is possible that faces in the hull are not triangular. It would be nice to triangulate the faces that are not triangular, so that the hull is a list of triangles.

Extra features

Some ideas:

Submitting your work

Make a folder called giftwrapping3d in your svn folder on microwave. I will have access to this svn, so no need to submit anything --- just make sure everything is checked in.

Enjoy!