Some ideas: - Divide each of the rectangles into 2 triangles, then calculate each 2 triangles intersection(from opposing rectangles). - Use "line sweep" method. - Ucse convex-polygon intersection method mentioned in almost every computational geometry book.(or find some on the internet)
Good Luck. On Tue, Jun 3, 2008 at 12:29 AM, Vasant <[EMAIL PROTECTED]> wrote: > > Greetings! > > As the subject line specifies, am trying to compute the area of > overlap between two rectangles that can have any arbitrary > orientation. I plan to go about this by finding vertices of Rectangle1 > contained in Rectangle2 and vice versa. Then, I will find the points > of intersection between the rectangles. Finally, I intend to compute > areas of individual triangles from a source vertex and add them to > calculate the final area of intersection. > > I wanted to know if there is an easier way of doing this. Any pointer > to a more effective method (if any) will be very useful. > > Hope to hear from you soon. > > Thanks! > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
