Open pjungeblut opened 8 years ago
Add code for the n*log(n) sweepline algorithm to compute all intersections of n line segments in the plane.
Tried to implement Bentley Ottmann algorithm today. Extremely tricky to get it working with all the different corner cases.
Add code for the n*log(n) sweepline algorithm to compute all intersections of n line segments in the plane.