Is it possible to compute a partitioning in convex sub-polygons using boost::geometry or boost::polygon?
I have a concave (non-convex) polygon and I would like to transform it into convex sub-polygons. Can boost do that?
I am not after an optimal solution... e.g. the Hertel-Mehlhorn algorithm would be great for instance.
I have checked docs for both libs here and here (and in many blogs or websites) and the answer is not obvious to me...