Tell me more ×
Geographic Information Systems Stack Exchange is a question and answer site for cartographers, geographers and GIS professionals. It's 100% free, no registration required.

Working in C++/GEOS, I would like to find all line/line segment intersections in a set of polylines, to a user specified precision (i.e. lines that approach to within said precision are considered as intersecting).

I am led to believe this is possible (http://gis.stackexchange.com/questions/33619/permissive-open-source-planarize-algorithm/33635#comment46301_33635) but haven't found the right bits of the API.

  • I can intersect two lines segments but for a set of polylines, presumably there is a more efficient way than brute force pairwise comparison?

  • How do you set cluster tolerance?

share|improve this question

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.