Sweeping lines and line segments with a heap

Given n line segments in the plane, the Bentley-Ottmann sweep maintains the exact ordering of the intersections of the segments with a vertical liie, as this line sweeps the plane from left to right. To accomplish thk, every intersection between two segments must be processed, and the running time of the sweep can be fl(nz ). In this paper, it is shown how a heap on the intersections can be maintained during the sweep. ThM new type of