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).
Geek Repo:Geek Repo
Github PK Tool:Github PK Tool
