Suppose I have two rectangles that are not necessarily axis-aligned. What is a fast way to calculate their intersection area?
- Note that I am aware of convex polygon intersection and area algorithms; however, I do not necessarily need the actual intermediate intersection area polygon definition, only the final area value itself so I'm wondering if there are some efficiencies to be gained over this straightforward approach.
- Triangle-based approaches are fine too.
- Approximate approaches may be of interest.