You have two intersecting quadrilaterals (the area of intersection is the grey polygon with thick boundary):These properties holds:One quadrilateral is always a rectangleThere is always some intersectionBoth quadrilaterals are convex (hence the intersection is a convex polygon as well)The goal is to measure area of intersection (the actual shape is not needed, only a scalar showing how much space is covered by the intersection).

Question

Julianna Bell · Accepted Answer

The algorithm goes as follows:For each vertex of the first quadrilateral, check whether it is contained inside the second one - if so, store coordinates of the point.For each vertex of the second quadrilateral, check whether it is contained inside the first one - if so, store coordinates of the point.For each edge of one of the quadrilaterals (does not matter which one), check for intersections with edges of the other. Store coordinates of intersection points.Compute triangulation for all the points stored so far.Sum up areas of the triangles.

Answered question

Answer & Explanation

New Questions in High school geometry