Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!elroy.jpl.nasa.gov!swrinde!zaphod.mps.ohio-state.edu!magnus.ircc.ohio-state.edu!tut.cis.ohio-state.edu!sei!fs7.ece.cmu.edu!o.gp.cs.cmu.edu!andrew.cmu.edu!ss7m+
From: ss7m+@andrew.cmu.edu (Steven M. Stadnicki)
Newsgroups: comp.graphics
Subject: Looking for Triangulation code
Message-ID: <IblLnGW00VoEETtF4W@andrew.cmu.edu>
Date: 22 Feb 91 20:19:30 GMT
Organization: Carnegie Mellon, Pittsburgh, PA
Lines: 10

Does anyone have quick code that can break a general planar (or, preferably,
3-D) polygon into triangles?  I could implement any of the dozens of algorithms
out there, I'm sure, but I don't really have the time, and would much prefer to
use someone else's (hopefully well-tested) code...

                                    Steven Stadnicki
                                    ss7m@andrew.cmu.edu
                                      or mail to
                                    pkh@cs.cmu.edu
                                      (which will get it here quicker)


Brought to you by Super Global Mega Corp .com