Find rectangles that contain point – Efficient Algorithm

Question

Good afternoon.

My situation:

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

Answer 1

R-Tree is the best data structure suitable for this use case. R-trees are tree data structures used for spatial access methods, i.e., for indexing multi-dimensional information such as geographical coordinates, rectangles or polygons. The information of all rectangles can be stored in tree form so searching will be easy

Wikipedia page, short ppt and the research paper will help you understand the concept.