Path: utzoo!attcan!uunet!lll-winken!lll-tis!helios.ee.lbl.gov!pasteur!ucbvax!united!djones
From: djones@united.berkeley.edu (David Jones)
Newsgroups: comp.graphics
Subject: Triangulating a convex hull in 3 space - reference wanted
Message-ID: <26659@ucbvax.BERKELEY.EDU>
Date: 1 Nov 88 17:55:28 GMT
Sender: usenet@ucbvax.BERKELEY.EDU
Reply-To: djones@united.berkeley.edu (David Jones)
Distribution: na
Organization: University of California, Berkeley
Lines: 16


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