Ivan Balaban's Optimal Algorithm in O(n log n + k)

It would be worth adding Ivan Balaban's "Optimal Algorithm" which hits the theoretical lower bound for segment intersection time and space complexity of O(n log n + k) and O(n), respectively.

Here is a link to his paper: https://www2.cs.sfu.ca/~binay/813.2011/Balaban.pdf

Also, he seems to have created a C++ implementation here: https://github.com/ivvaan/balaban-segments-intersections

Some additional work would need to be done to handle degenerate cases.

Start by reviewing the repository's current segment-intersection implementation, then read the linked Balaban paper and C++ implementation. Define how degenerate cases should be handled and how the proposed algorithm would be validated against the stated time and space bounds; the issue names no files or tests.

Written by the indexing model from the issue text.