data structures - Bounding box inside another bounding box?

Question

We assume a data structure containing n objects. Each object is representing a rectangle the following way: {minX: -2, minY: -2, maxX: 2, maxY: 2}. Each rectangle can overlap one another, but don‘t have to.

Task

Create an efficient function/algorithm to find out given rectangle is within one or multiple objects of the data structure. See also the image below whereby the red rectangle is the given one and the black ones are objects in the data structure.

Question Can someone please help me with that?

question from:https://stackoverflow.com/questions/66054351/bounding-box-inside-another-bounding-box

Answer 1

Waitting for answers