Bentley-Ottmann algorithm
The Bentley-Ottmann algorithm for finding intersections among a set of line segments. This algorithm is part of a larger algorithmic paradigm known as 'sweep line algorithms', which are particularly useful in computational geometry. Another example is a sweep line algorithm for contracting 2D tensor networks https://arxiv.org/abs/2101.04125
My links: https://linktr.ee/cchubb