Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!cs.utexas.edu!csd4.milw.wisc.edu!bionet!ames!elroy!mahendo!wlbr!jm
From: jm@wlbr.IMSD.CONTEL.COM (James Macropol)
Newsgroups: comp.graphics
Subject: Concave polygon problem
Keywords: polygon fill concave convex
Message-ID: <32132@wlbr.IMSD.CONTEL.COM>
Date: 7 Jun 89 21:28:31 GMT
Reply-To: jm@wlbr.imsd.contel.com (James Macropol)
Organization: Contel FSD, Westlake Village, CA
Lines: 13

I have been  looking for an  algorithm to convert  a (possibly)  concave
polygon into a set  of convex polygons  that cover the  same area.   The
algorithm need not be  optimal, but should do  a reasonable job, and  be
fast.

I have been unable to find such a  beast, but I know that it must  exist
somewhere.

Any ideas or references would be much appreciated.
------
Jim Macropol
Contel Federal Systems		(818)706-5202
jm@wlv.imsd.contel.com		wlbr!jm