CGAL users discussion list

["Dave Ceddia" <>]

Hello CGAL experts,

I am trying to compute the visibility graph among a set of polygons, and there are a couple things I can't think of how to do nicely using CGAL. For now, I'm trying to figure out how to do segment-polygon intersection. Some of the lines of the visibility graph need to connect from a polygon back to itself (since the polygons are non-convex), but I want to avoid introducing lines that are internal to the polygon. I can't seem to think of a way of testing for intersection of a segment with a polygon, is there a simple way to do this in CGAL?

Thanks,
Dave