Does the intersection of two concave polygons without holes result in a set of several polygons without holes?

Ilnaus5 2022-09-16 Answered
Does the intersection of two concave polygons without holes result in a set of several polygons without holes?
I did not find a proof anywhere, so here is my assumption :
If I have 2 concave and simple polygons without holes, then the intersection yields a set of different polygons without any holes.
If it can result to a polygon with a hole inside, could you provide an example?
Edit: the polygons are simple. edges of one polygone don't intersect, except consecutive edges, which intersect in their common vertex. The polygons in input do not have holes. I consider the intersection of the interiors of the polygons. The resulting set is all the points that are included both in interior of polygon P1 and the interior of the polygon P2.
You can still ask an expert for help

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (1)

asijikisi67
Answered 2022-09-17 Author has 10 answers
Explanation:
Call the two polygons P 1 and P 2 . Suppose that some point x P 1 P 2 , but there is a curve inside P 1 P 2 encircling x. Since x P 1 P 2 then x P 1 wlog. But there is a curve encircling x which is inside P 1 and therefore P 1 has a hole.

We have step-by-step solutions for your answer!

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

You might be interested in

asked 2022-08-18
Covering the plane with convex polygons?
I have got the following task here:
Prove, that you can't cover the "Plane" with convex polygons, which have more than 6 vertices!
The answer is pretty obvious for n = 3 vertices, because 6 60 = 360 .
For n = 4 it works too, because 4 90 = 360 .
I think that n = 6 is good too, but how do I prove, that other than that, it isn't possible to do that?
asked 2022-07-16
Polygons with two different angles
I have the following questions:
Let us consider polygons with only two different interior angles α and β = π α.
For which frequencies of these angles is it possible to form a closed polygon?
asked 2022-08-09
“Area metric” and “Hausdorff metric” are not equivalent on all closed polygons, but equivalent on convex closed polygons
Suppose X is the set of all closed polygons, d Δ is the “area metric” defined by the area sum of the symmetric difference of two closed polygons, and dH is the Hausdorff metric on X. How should I prove that d Δ and d H do not generate the same topology on X? Also why do they generate the same topology on the subset of convex polygons? I tried to visualize how a typical open ball in both metrics looks but this seems rather impossible.
asked 2022-08-22
Question regarding polygons
Can you prove, that if a equilateral lattice n-gon is constructible, then there will be such a polygon for which the sides have minimal length?
asked 2022-08-05
The area of a triangular sail for a boat is 176 square feel. If the base of the sail is 16 feet long, find its height.
asked 2022-08-11
Scan line algorithm for intersecting polygons
Given two sets of polygons P 1 = { s 1 , . . . , s m } and P 2 = { s m + 1 , . . . , s n } with total number of n segments, the previous and next segment on it's polygon can be determined in O(1). Describe a scan-line algorithm that computes all points of P 1 P 2 in O(n).
asked 2022-08-11
Constructible polygons
I know certain polygons can be constructed while others cannot. Here is Gauss' Theorem on Constructions:
cos ( 2 π / n ) is constructible iff n = 2 r p 1 p 2 · · · p k , where each p i is a Fermat prime.
Can this is be used to determine the constructibility of a regular p 2 polygon? If so how and what would be the cos ( 2 π / n ) here?

New questions