Segment Intersection using a Sweepline


PQ (and Balanced Tree) Application:

	Line Segment Intersection

•

Given a set of line segments

in the plane, report all

intersections

•

Obvious method:

–

Try each pair of segments

–

Running time = O(n²)

•

If there are a lot of

intersections then this is the

best we can do, but what if

there are few intersections?

CS409 - Spring 2000