Plane sweep algorithm

Given two lines
O(n^2)times to calculate the total intersection points
But we need to solve faster
Plane sweep does this in (nlog(n))time

FAQ:
When does it fail?
a.It fails if events are much .then plane sweep algo works in O(n^2)time