As the title suggests, I'm trying to implement an algorithm to decompose a polygon into the minimum number of star-shaped polygons. I've been searching for quite some time but I can't find any algorithms or even anything theoretical to study on this problem online. The closest I found is decomposition to the minimum number of convex polygons.
Any suggestions as to how I should approach the problem?
I've tried to think about it by myself but the combinations seem too many and I don't want to get into writing an algorithm while my main problem is still unsolved.