# Find the intersection of two or more polygons in terms

Find the intersection of two or more polygons in terms of linear inequalities
Given two or more closed polygons each defined by a system of linear inequalities, is there any method by which their intersection polygon may be determined, also in terms of a system of linear inequalities?
You can still ask an expert for help

## Want to know more about Inequalities systems and graphs?

• Questions are typically answered in as fast as 30 minutes

Solve your problem for the price of one coffee

• Math expert for every subject
• Pay only if we can solve it

diamondogsaz
In general, the number of inequalities used to describe one convex polytope (high dimensional polygon) may not equal the number needed to describe another, even if they share the same dimension.
Consider a triangle, which in ${\mathbb{R}}^{2}$ requires 3, while a pentagon requires 5.
If $A$ is the set of linear inequalities for one polygon and $B$ is the set of linear inequalities for another, you could consider $A\cup B$ to describe their intersection.