Given \(N\) rectangles, find all the intersections. This algorithm is very similar to the 1-D line intersection search. The difference...
Suppose we have \(N\) 1-D intervals of the form \((a,b)\) where \(a
This is like the 1-D range search, but where the keys can now have two coordinates. It’s finding the number of points in a rectangle...
Sample problems we want to solve: What are all the keys between two keys? (Relevant to databases) How many keys exist between two keys?...