Path: utzoo!utgpu!attcan!uunet!lll-winken!lll-lcc!ames!mailrus!cornell!uw-beaver!rice!titan!foo
From: foo@titan.rice.edu (Mark Hall)
Newsgroups: comp.graphics
Subject: Re: 3-D triangulation
Message-ID: <2425@kalliope.rice.edu>
Date: 6 Jan 89 18:56:33 GMT
References: <72@rpi.edu>
Sender: usenet@rice.edu
Reply-To: foo@titan.rice.edu (Mark Hall)
Organization: Rice University, Houston
Lines: 21

In article <72@rpi.edu> kyriazis@turing.cs.rpi.edu (George Kyriazis) writes:
>
>There are known algorithms that can triangulate 2-D points.  My question
>is:  Is there any algorithm to do same thing in 3-D (well, whatever gets
>closer to it).  
>
>  George Kyriazis
>  kyriazis@turing.cs.rpi.edu
>------------------------------


  Triangulating a plane corresponds to finding tetrahedra in 3D.

  One reference is A. Bowyer, "Computing Dirichlet Tessellations", 
                   Computer J., 24 (1981), pp. 162-166.

  This produces a "Delaunay Tessellation".

  Hope this helps. 

  - mark