I have this problem: given a set of rectangles $\{R_1, R_2...R_n\}$, and a new rectangle $R_q$, find where to put $R_q$ so it intersects (it does not matter how much area) the maximum number of the rectangles in the set. An answer will be very appreciated, thanks!
Place rectangle maximizing rectangle intersections
1
$\begingroup$
geometry
-
0Tha$t$'s correct, however I'm trying to solve the problem in an average case where the R1..Rn are near each other, and Rq does not have a very small size. I'm not worrying about the border cases. – 2012-09-18