Find rectangles that contain point – Efficient Algorithm

Question

Good afternoon.

My situation:

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

Answer 1

In java you can use shape.contains

But in general, assuming a rectangle is defined by (x,y,width,height) you do

if (pt.x >= x && pt.x <= x + width && pt.y >= y && pt.y <= y + height) ...

If you have all your rectangles in a collection you can iterate over the collection and find the ones that contain the point