
Does anyone know how to use boost Polygon or boost GGL to take a convert a polygon with holes to a polygon with no holes? I am looking for functionality similar to this http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Boolean_set_operations_2.... I have already found a way to extract trapezoids using boost Polygon but I was hoping there was a method more similar to connect_holes. Thanks a lot, Dan

Hi Dan, Macumber, Daniel wrote:
Does anyone know how to use boost Polygon or boost GGL to take a convert a polygon with holes to a polygon with no holes? I am looking for functionality similar to this http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Boolean_set_operations_2.... I have already found a way to extract trapezoids using boost Polygon but I was hoping there was a method more similar to connect_holes.
As also described on the GGL-mailing list:
No, Boost.Geometry does not (yet) provide conversion from polygons with holes to so-called key-holed polygons as you describe. Normally this is necessary or useful for graphic user interfaces. The algorithm is not that difficult, visiting the outer polygon and after that the inner rings, while pushing the first point of the outer polygon between all inner rings, is normally enough. This can be done by normal iterators.
Regards, Barend
participants (2)
-
Barend Gehrels
-
Macumber, Daniel