Xref: cantaloupe.srv.cs.cmu.edu comp.sys.sgi.misc:2119 comp.graphics:39060
Newsgroups: comp.sys.sgi.misc,comp.graphics
Path: cantaloupe.srv.cs.cmu.edu!das-news.harvard.edu!noc.near.net!howland.reston.ans.net!wupost!bigboy.sbc.com!news.mtholyoke.edu!news.smith.edu!orourke
From: orourke@sophia.smith.edu (Joseph O'Rourke)
Subject: Re: Looking for polygon "convexifier"
Message-ID: <1993May2.155829.7530@sophia.smith.edu>
Organization: Smith College, Northampton, MA, US
References: <1rq5m5INNmpp@harpo.uccs.edu> <1rvpmc$3dd@nwfocus.wa.com>
Date: Sun, 2 May 1993 15:58:29 GMT
Lines: 10

In article <1rvpmc$3dd@nwfocus.wa.com> mpdillon@halcyon.com (Michael Dillon) writes:
>>Does anyone know where I can find a code which would take concave
>>polygons and break them up into a set of convex polygons?
>
>I also would like code or algorithms to do this.

	Although I am not offering code, I would like to point out that
any polygon triangulation code satisfies the task as stated.  If you
want code to partition a polygon into the *minimum* number of convex
pieces, I doubt very much if it exists, although an algorithm is known.
