[Boost-users] [Geometry] Finding polygon self-intersections efficiently

Subject: [Boost-users] [Geometry] Finding polygon self-intersections efficiently
From: Rob Conde (rob.conde_at_[hidden])
Date: 2013-11-22 16:56:51

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