Bentley Ottman Algorithm to find the intersection points in the 2d plane for lines. The algorithm is input sensitive and has a running time complexity of O((N + K) log N) and space complexity of O(N).
Run the ./run.sh file to run the algorithm followed by the plotting of the segments and the intersection points.
testcases.txt file contains the segments in the specific form of x1 y1 x2 y2.
output.txt file will contain the intersection points after running the algorithm.
plotting.py contains the python script for plotting the segment.
Bentley Ottman Algorithm to find the intersection points in the 2d plane for lines. The algorithm is input sensitive and has a running time complexity of O((N + K) log N) and space complexity of O(N).