Xref: utzoo comp.graphics:7495 sci.math:7866
Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!gatech!hubcap!madhu
From: madhu@hubcap.clemson.edu (m  a  d  h  u)
Newsgroups: comp.graphics,sci.math
Subject: Re: Polygon Triangulation.
Message-ID: <6466@hubcap.clemson.edu>
Date: 15 Sep 89 06:49:32 GMT
References: <BRISTER.89Sep11091622@aries.td2cad.intel.com> <7918@cbmvax.UUCP>
Distribution: comp
Organization: Clemson University, Clemson, SC
Lines: 20

> In article <BRISTER.89Sep11091622@aries.td2cad.intel.com> brister@td2cad.intel.com (James Brister) writes:
> >I have a little problem...... :-)
> >
> >Given a sequence of vertices that represent the points on a polygon. I need to
> >(somehow) reduce this into two (or more) smaller polygons that have a (new)
> >common edge......
> >
> >James
> 
In article <7918@cbmvax.UUCP>, mitchell@cbmvax.UUCP (Fred Mitchell - QA) writes:
> I have run across this problem myself. I have created a way to test for
> concavity, but its rather tricky and I have not fully implemented it yet.

	Yamaguchi Fujio, Tokieda Toshiya,"Bridge Edge and Triangulation
	approach in solid modeling," Frontiers in Computer Graphics, Proc.
	Computer Graphics Tokyo '84, edited by Tosiyasu L. Kunii, PP. 44-65,
	Springer-Verlag, 1985.

This is probably what you should look at. 
	madhu