Sweep-Line Ladder¶
Who This Is For¶
Use this ladder when pairwise checking is too slow and you are ready to think in terms of events, active sets, and local updates.
Warm-Up¶
- event sorting
- active-set maintenance
Core¶
- tie-breaking rules
- local-neighbor reasoning
Example Notes¶
- KINGDOMS
- VOTELPH
- compare point: Closest Pair when the sweep is specifically one active-strip nearest-pair pass
Exit Criteria¶
You are ready to move on when you can:
- design a stable event order
- explain what the active set means between events
- justify why local neighbors are enough
- debug boundary timing like "before x" vs "after x"