Grishound / Sweep_Line_Algorithm

A sweep line algorithm which finds all the intersection points in a layer of wires.

Part of pset3 of MIT OCW 6.006 Fall 2011.

A sweep line algorithm which finds all the intersection points in a layer of wires.

Uses an AVL tree to store the wires currently in contact with the sweep line.