kirill-terekhov / SweepLine

Implementation of sweep line algorithm for intersection of segments

SweepLine

Given a number of segments, finds their intersection points and outputs a new set of non-intersecting segments connected to intersection points.

Example

Example hardcoded into main