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

Try this

Source Rectangle : X0, Y0, breadth, height

// Basically comparing the edges

if(((X0 >= xi) && (X0+breadth <= Xi)) && ((Y0 >= Yi)&&(Y0+height <= Yi)) { //consider the rectangle } else { // discard }