TITLE: Partitioning a polygon into convex parts
QUESTION [18 upvotes]: I'm looking for an algorithm to partition any simple closed polygon into convex sub-polygons--preferably as few as possible.
I know almost nothing about this subject, so I've been searching on Google Scholar and various computational geometry books, and I see a variety of different methods, some of which are extremely complicated (and meant to apply to non-simple polygons). I'm hoping there's a standard algorithm for this, with a clear explanation, but I don't know where to find it.
Can anyone point me to a source with a clear explanation of how to do this?

REPLY [2 votes]: I don't know, whether this is an already known algorithm and I also don't know how optimal the resulting partioning will be, but its description and implementation are simple:

identify the set of inflex points, i.e. where a right-turn is made when going around the polygon counter clockwise  
calculate the nested convex hull of the inflex point set  
cut the polygon along the edges of the nested convex hull, that are inside the polygon