Find rectangles that contain point – Efficient Algorithm

Question

Good afternoon.

My situation:

• In two-dimensional space.
• Input: a set of rectangles (ov

Answer 1

Here is a simple solution.

1. Define a grid on your plane.
2. Each cell maintains two lists: the rectangles that completely cover this cell and the rectangles that partially cover this cell.
3. On each insertion, put the ID of the target rectangle into all the involved cell lists.
4. On each query, locate the cell that contains the target point, output the completely cover list and run a scan on the partially cover list.