ConceptTheory & Algos
Binary merger via upward sweep
An algorithm used during the merge step of a divide-and-conquer approach to count how many rectangles contain each point by sweeping a horizontal line upwards.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Divide and conquer1Sweep-line algorithm1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.