   Tesselating concave polygons into convex
  I'm looking for an algorithm that splits up a concave polygon into a minimal number of convex polygons. Can anyone point me in the direction of a good resource on the subject? I've tried looking up some resources but I've had little luck.Thanks   
  You mean something like this ?http://www.flipcode.com/articles/article_tesselating.shtmlOr maybe like this ?http://www.codeproject.com/Purgatory/polygon_tesselation.asp?df=100&forumid=3250&exp=0&select=112508;  Triangulating a polygon is easier than decomposing a polygon into the _minimum_ number of convex polygons.  "Computational Geometry in C, 2nd edition" by Joseph O'Rourke has a small section on "convex partitioning".  An easy algorithm that decomposes a polygon into no more than four times the optimal number of convex pieces is the Hertel-Mehlhorn algorithm.  You start with a triangulation and add back in diagonals in an attempt to get large convex subpolygons.O'Rourke's book has a few references to the literature for convex partitioning.  One of the examples shown indicates that you can get an optimal partition by introducing interior points and segments.Not in his references is "On the time bound for convex decomposition of simple polygons" by J. M. Keil and J. Snoeyink, Proceedings of the 10th Canadian Conference on Computational Geometry, 1998, pg. 54-55.  This is based on dynamic programming and is difficult to get right.  I recall there being a Java applet available online with an implementation.  And I recall it not always working correctly.;  That algorithm (triangulate, then join back) is a great one. Thanks for the great reference.   