ressler@nbs-amrf.UUCP (03/05/86)
Well I hadn't intended on doing a summary of responses but since I've received several queries as well as help here are some pointers to algorithms to decompose a polygon into convex polygons... (I haven't seem most of this stuff but I sounds good) "Computational Geometry and Convexity" by Bernard Chazelle CMU-CS-80-150 a Dissertation ( someone informs me that this was a YALE thesis and he later went to CMU where it was also published as a tech report??) ....Good stuff, I will probably use his "naive" algoritm for an implementation. "Introduction to Computational Geometry", Preparata & Shamos, Springer-Verlag book "Decomposing a polygon into its convex parts", Proc 11th SIGACT Symp. Atlanta, 1979, pp38-48 "Decomposing of polygons into convex sets", Schacter, B. IEEE Trans. on Computeres, Vol C-27, 1978 pp 1078-1082 "Decomposing a simple polygon with the relative neighborhood graph", Proceedings of the Allerton Conference, Urbana, Illinois, Oct. 1980 Have fun decomposing... and thanks to all those who responded .. hope this helps some of you who asked.. Sandy Ressler ..!{seismo | umcp-cs}!nbs-amrf!ressler