CGAL users discussion list

[Renato Silveira <>]

I have to compute the max (or near-max) convex polygon inside a concave polygon. I found the function CGAL::maximum_area_inscribed_k_gon_2 which works for convex polygons.  

 

Partitionate polygons in convex parts didn't help me.

Is there any way to do this using CGAL?

Thanks in advance,

Renato

--
Renato Silveira

     Ph. D. Student
     Informatics Institute - UFRGS
     Porto Alegre - RS - Brazil

     http://www.inf.ufrgs.br/~rsilveira