Intersection of N rectangles

Question

I\'m looking for an algorithm to solve this problem:

Given N rectangles on the Cartesian coordinate, find out if the intersection of those rectangles is empty or no

Answer 1

I think you should use something like the sweep line algorithm: finding intersections is one of its applications. Also, have a look at answers to this questions