Given a possibly self-intersecting polygon, I'm trying to find the self-intersecting segments of the polygon. I can do this naively of course using Segment and intersects, but I'd like to know if there's a more efficient suggested approach in Boost.Geometry...I'm having a hard time finding anything from the documentation. Thanks, Rob Conde