Plane Sweep Algorithm for finding Line Segment Intersections

Ah neat, this made fortune's algorithm click a bit better in my head!

The best explanation I've seen on this topic🏅🏅🏅

Thank you professor. We're grateful for your diligent effort.

The best explanation I could find on this topic!
Thank you

Thank you Prof. I only wish that for just that are just starting now, some code be shown and explained so we’d have a glimpse of how to actually mod this in code

Professor, I was not able to understand how did you write the horizontal line segment comparison in status comparator as in the book (computational geometry algorithms and applications) on p. 26 it is written that horizontal line segments must be placed last, I am not sure how does your code work. But it works correctly as I have seen in my points test cases.

Thanks and Regards

one of the greatest explanation for this topic. Nice job!