Fast polyline (line segments) intersection (fast version of bentley-ottmann and more than that)
-
Updated
Oct 3, 2024 - C++
#
bentley-ottmann
Here are 3 public repositories matching this topic...
Simple implementation of bentley ottmann algorithm in c++ to find intersections between segments
-
Updated
Dec 26, 2024 - C++
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).
-
Updated
Apr 9, 2022 - C++
Improve this page
Add a description, image, and links to the bentley-ottmann topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the bentley-ottmann topic, visit your repo's landing page and select "manage topics."