Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!uunet!sdrc!gcchou
From: gcchou@sdrc.UUCP (jin chou)
Newsgroups: comp.graphics
Subject: Re: Polygon Triangulation
Message-ID: <810@sdrc.UUCP>
Date: 18 Sep 89 20:59:08 GMT
References: <11820@polya.Stanford.EDU>
Organization: Structural Dynamics Research Corp., Cincinnati
Lines: 22

In article <11820@polya.Stanford.EDU>, sumane@anaconda.stanford.edu (Thilaka Sumanaweera) writes:
> [Stuff deleted]

> Delaunay triangulation gives a set of triangles having

> the polygon-vertices as corners and whose union is the
> convex hull of the polygon-vertices. Triangles outside
> the polygon can be eliminated using the fact that the
> polygon-vertices are oriented. This will yield a set
> of triangles, whose union is the given polygon.
> 

    But the edges of the given polygon may not be in the 

set of edges of the Delaunay triangulation.  It is not

clear how you can handle these efficiently.

> [Stuff deleted] 
> Thilaka

Jin Chou