find overlapping rectangles algorithm

Question

let\'s say I have a huge set of non-overlapping rectangle with integer coordinates, who are fixed once and for all

I have another rectangle A with integer coordinate

Answer 1

Let your set of rectangle be (Xi1,Yi1,Xi2,Yi2) where i varies from 0 to N.

Rectangle A and B can NOT be intersecting if Ax1 > Bx2 || Ay1 < By2 || Bx1 > Ax2 || By1 < Ay2.

Create tree which is optimized for range/interval (For exa: segment tree or interval tree) See http://w3.jouy.inra.fr/unites/miaj/public/vigneron/cs4235/l5cs4235.pdf

Use this tree to find set of triangle while your triangle is changing coordinates.