The Bentley-Ottman algorithm works to find the intersections of the set of lines. But I have a lot of polylines:
Is there a way to find the intersections of multiple polylines?
I find out, but in the meantime, if someone can give some pointers or ideas, it will be helpful. Thanks for reading. By the way, I'm using WPF / C #, and all the polylines are PathGeometry.
Image source: http://www.sitepen.com/blog/wp-content/uploads/2007/07/gfx-curve-1.png
, . , , ( ).
R-Tree , R-Tree . . , R- , , , .
CGAL .
Geom (R-Tree - ), , :
1. . . --. , , , / ( - ).
, . , , , .
2. R-Tree ( ). , , , ( ). , .
3. , . , 2. , , . ( , ). , , ( , , ).
4. , , . ( ).
- ( , Geom). , , (, angular), ( , ).
, , , - , , , , . , , .