Path: utzoo!attcan!uunet!lll-winken!lll-lcc!ames!mailrus!cornell!batcomputer!sun.soe.clarkson.edu!rpi!rpics!kyriazis
From: kyriazis@rpics (George Kyriazis)
Newsgroups: comp.graphics
Subject: 3-D triangulation
Message-ID: <72@rpi.edu>
Date: 5 Jan 89 04:58:33 GMT
Sender: usenet@rpi.edu
Reply-To: kyriazis@turing.cs.rpi.edu (George Kyriazis)
Organization: RPI CS Dept.
Lines: 19


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).  

Basically I want to have my points completely connected.  A spanning tree
is not enough.  If I want to find a path between two points, I want to
have a reasonably fast roote between them (meaning with few points).

Is there an algorithm that can help me?  If that information is not enough,
I'll post another article with more details.

Thanks again for any help.


  George Kyriazis
  kyriazis@turing.cs.rpi.edu
  kyriazis@ss0.cicg.rpi.edu
------------------------------