Resolved in class, Thurs, 2/15/07

0. For program 3, you will work with lists of polyhedra.  They may or may not
have disjoint bounding boxes, but they will have disjoint convex hulls.

1. Implement
        a. bounding box generation and checking
        b. convex hull generation
        c. disjoint convex hull checking

2. Sort polyhedra and display, using painter's algorithm

3. Testing will be in class, with data sets that I supply.

Format of data
k (# of polyhedra)

n (# polygons in Polyhedra 0)
m_0 (# vertices in polygon 0)
x_0 y_0 z_0
       
x_(m_0) y_(m_0) z_(m_0)

Continue in this nested way ...

All vertices are floating point numbers (Steps 1 & 2 need to treat that.)

4. Due, in class, for live tests, 3/1/07.