The Bentley-Ottmann algorithm is used for the computation of intersection of line segments.
However, instead of finding the intersecting points of all the lines among themselves, I want to find the intersecting points between two groups of lines. This is to say that for every line in line group A, I want to know the intersection points between those lines and the lines in group B.
A
B
Is there anyway I can extend the Bentley-Ottmann algorithm for this? I already have the existing Bentley-Ottmann algorithm implemented (in the library of CGAL), and I am not keen to modify it. I am, however, am keen to find ways to reuse it and extend it.
mobdro
The Bentley-Ottmann algorithm is not developed by Bentley Systems Inc. We are the developers of software solutions for supporting infrastructure all around the globe. You can find more about us at https://www.bentley.com/.
Sorry that we cannot be of much assistance with this question. You may try out other online forums.
Hello,Just found this reference (may be helpful). Here is a paper explaining how to extend Bentley-Ottman sweep to the most optimal algorithm:
http://www.cs.unc.edu/~snoeyink/demos/rbseg/jcdcg25.pdf fast essay pdf