Algorithm required to determine if a rectangle is completely covered by another set of rectangles

Question

I am searching for an algorithm that will determine if a new rectangle is completely covered by a set of existing rectangles. Another way of putting the question, is does the ne

Answer 1

R-tree may be useful. if there might be rotated rectangles, you can enclose them in bounding rectangles.