[comp.graphics] Triangulating a convex hull in 3 space - reference wanted

djones@united.berkeley.edu (David Jones) (11/02/88)

I think I have seen some recent discussion on 2D convex hull algorithms
in this news group.  Does anyone out there know of a reference to
a straightforward (or maybe even not so straightforward) algorithm
to calculate the triangular faces of a convex hull given a set
of points in 3 space.  In my particular application I know all the points
do lie on the convex hull, but I doubt that simplifies matters.

It strikes me there should be an NlogN divide-and-conquer algorithm,
but I'll take any working solution for now.

Please reply directly to
	djones@united.berkeley.edu
since reading news is unreliable on my machine.

Any pointers will be appreciated,
 David Jones