Background Information and Techniques - Computer Animation: Algorithms and Techniques - page 433

(all of the points within some epsilon of being coplanar) into a set. Second, initialize the current edge to
be the unmatched edge of step 4 and add the first point of the current edge to the set of coplanar points.
Third, iteratively find the point in the set of coplanar points that makes the smallest angle with the
current edge as measured from the first point of the edge to the second point of the edge to the candidate
point. When the point is found, remove it from the set of coplanar points and make the new current edge
the edge from the second point of the old current edge to the newly found point. Continue iterating until
the first point of the original unmatched edge is found. This will complete the convex hull polygon,
which is then added to the list of convex hull polygons; its newly formed edges are processed as in
step 4 (see Figure B.25 ).
FIGURE B.25
Convex hull code.