Finds all intersections in one or two sets of edges, using a simple x-axis sweepline algorithm. While still O(n^2) in the worst case, this algorithm drastically improves the average-case time.
Other
version: 1.7
public SimpleSweepLineIntersector()
public void computeIntersections(List
edges, SegmentIntersector si, boolean testAllSegments)