A vertical line sweeps left→right; events drive a status structure; intersections are detected when neighbors meet.
| Operation | Cost |
|---|---|
| Sort all events | O(n log n) |
| Status insert / delete / neighbor | O(log n) |
| Event-queue extract-min / insert | O(log n) |
| Bentley–Ottmann (report all) | O((n + k) log n) |
| Naive all-pairs baseline | O(n²) |