3

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...

Cœur
  • 37,241
  • 25
  • 195
  • 267
arennuit
  • 855
  • 1
  • 7
  • 23
  • 2
    If you had some sample code here showing what you tried to solve the problem that would make it a lot better than what is pretty vague right now. What data structures do you have? How does Boost come into play? – tadman Sep 21 '17 at 22:27
  • This might not cover your use case, but you can have a look at Boost Polygon's `polygon_set_data`, which supports triangulation through `get_triangles`. – Ton van den Heuvel Nov 09 '17 at 21:08
  • This is interesting! – arennuit Nov 10 '17 at 08:39

0 Answers0