ressler@nbs-amrf.UUCP (02/28/86)
Does anyone out in graphics land have any code, or pointers to
algorithms which would decompose planer polygons into a set of convex
polygons. Specifically this is for some work I'm doing on an Iris
2400 which only handles convex polygons. If anyone happens to have
a routine lurking in their back pockets please let it crawl over this
way....
Thanks in advance,
Sandy Ressler
..{seismo | umcp-cs}!nbs-amrf!resslerthomas@utah-gr.UUCP (Spencer W. Thomas) (03/05/86)
Some recent references:
"Convex Decomposition of Simple Polygons", Tor & Middleditch,
TOG Vol 3, No 4, October 1984, p 244.
"Triangulation and Shape Complexity", Chazelle and Incerpi, TOG
Vol 3, No 2, April 1984, p 135.
"Triangulating Simple Polygons and Equivalent Problems",
Fournier and Montuno, TOG Vol 3, No 2, April 1984, p 153.
--
=Spencer ({ihnp4,decvax}!utah-cs!thomas, thomas@utah-cs.ARPA)