Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sun-barr!decwrl!bacchus.pa.dec.com!rust.zso.dec.com!shlump.nac.dec.com!ryn.esg.dec.com!allvax.enet.dec.com!jroth
From: jroth@allvax.enet.dec.com (Jim Roth)
Newsgroups: comp.graphics
Subject: Re: Forming polygons from  points in 3d
Message-ID: <3352@ryn.esg.dec.com>
Date: 30 Oct 90 23:07:32 GMT
Sender: guest@ryn.esg.dec.com
Organization: Digital Equipment Corporation
Lines: 18


In article <9010252023.AA02947@polymer.che.clarkson.edu>, abstine@polymer.che.clarkson.edu (Art Stine) writes...
>Does anyone have an algorithm or maybe even some code which will
>take a set of points in 3d and basically 'shrink-wrap' them (ie, form
>a volume from them by connecting all the 'outside' points)

There is a recent ACM TOG paper:

	A. M. Day
	The implementation of an algorithm to find the convex hull of
	a set of three-dimensional points
	ACM TOG Vol 9 No 1, Jan 1990, pp 105-132

Includes Pascal code.  It is based on the well-known Preparata-Hong
algorithm, with due care to handle the annoying degenerate cases that
can arise.

- Jim