the-hyp0cr1t3/sweepline-intersections
Given n line segments, efficiently find all points of intersection. This is a modern C++ implementation of the Bentley-Ottman algorithm from (almost) scratch because why not.
C++
Given n line segments, efficiently find all points of intersection. This is a modern C++ implementation of the Bentley-Ottman algorithm from (almost) scratch because why not.
C++