Algo goes something like this.
Rectangles are represented by two points TopLeft and bottomRight or
BottomLeft and TopRight
1. Choose Xmin and Xmax from Rectangle A. Check if any of the x-coordinates
of rectangle B fall in between Xmin and Xmax of A.
2. choose Ymin and Ymax from Rectangle A. Chec
compare the relative positions of the coordinates
On Sat, Aug 6, 2011 at 9:10 PM, Algo Lover wrote:
> Given 2 rectangles not necessary parallel to co-ordinate axis. How
> would you find if the rectangles intersect and if they do find the
> intersection points
>
> --
> You received this message b
Given 2 rectangles not necessary parallel to co-ordinate axis. How
would you find if the rectangles intersect and if they do find the
intersection points
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to alg
What is the most efficient way to compute the intersecting area of 2 rectangles? Dont assume anything about the relative postions of the 2 rectangles. They can be aligned in any manner relative to one another.
--~--~-~--~~~---~--~~
You received this message because
