Path: utzoo!attcan!uunet!cs.utexas.edu!tut.cis.ohio-state.edu!pt.cs.cmu.edu!rochester!uhura.cc.rochester.edu!cs!sbcs!bnlux0!shadooby!itivax!umich!zip!spencer From: spencer@eecs.umich.edu (Spencer W. Thomas) Newsgroups: comp.graphics Subject: 3-D triangulation? Message-ID: Date: 8 Aug 89 22:11:41 GMT Sender: news@zippy.eecs.umich.edu Distribution: comp Organization: University of Michigan EECS Dept Lines: 14 Can someone point me to a 3-D "triangulation" algorithm? What we need is something equivalent to the 2-D Delauney triangulation. I.e., we want to create a set of tetrahedra that fill the space within the convex hull of a set of randomly distributed 3-D points. I found reference to 3-D Voronoi diagrams in Preparata and Shamos, but not even an algorithm (although there seems to be reference to work that may contain an algorithm). And, in any case, it's not obvious how to go from the Voronoi diagram to a triangulation. Reference to an accessible publication would be sufficient. -- =Spencer (spencer@eecs.umich.edu)