Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!uakari.primate.wisc.edu!uflorida!gatech!rutgers!cunixf.cc.columbia.edu!cs.columbia.edu!krish
From: krish@cs.columbia.edu (ponamgi)
Newsgroups: comp.graphics
Subject: Triangulation of Arb. Polygon with polygonal holes
Message-ID: <1990Oct12.193235.22314@cs.columbia.edu>
Date: 12 Oct 90 19:32:35 GMT
Sender: news@cs.columbia.edu (The Daily News)
Reply-To: krish@hudson.columbia.edu (ponamgi)
Followup-To: comp.graphics
Distribution: comp.graphics
Organization: Columbia University Department of Computer Science
Lines: 12


I've looked in the general refrences (Foley, VanDam, Feiner, Hughes) and 
etc. and I sent mail to the machine at DEC with no luck.  I've also looked
at a number of papers in TOG, Visual Computer, Pattern Matching, and etc.

I have a method to do this already, but before I started coding I was
curious to see if someone has already done this.  The method should NOT
introduce new vertices than those already specified.  If someone has
code they would like to share, I'd be appreciative.

thanks,
krish ponamgi