This program implements an extremely efficient randomized computational geometry algorithm for calculating all the intersections in a set of line segments. It runs in O(A+nlogn) expected time where A is the output size.