I have several polygons, which intersect/overlap each other. I only consider the border of the polygons now, the inside is irrelevant.

Is there a well-known algorithm to divide the intersecting polygon borders into new polygons, which do not intersect (but are adjacent)?

Example: A David-Star ✡ can be seen as two intersecting triangles (one pointing up, one pointing down). I am looking for an algorithm to divide the polygons into six triangles and one hexagon in the middle. Adjacent polygons may not be merged here.

I have looked for an algorithm for this, but failed. Maybe I do not know the correct keyword to look it up?

  • $\begingroup$ googling "polygon intersection algorithm" seems to give a lot of nice stuff $\endgroup$ Aug 23, 2018 at 11:18
  • $\begingroup$ @AleksejsFomins I primarily find algorithms there which determine the intersecting area of two polygons, which is not exactly what I am looking for $\endgroup$
    – Ctx
    Aug 23, 2018 at 13:41
  • $\begingroup$ I thought sth like this returns a polygon, not an area en.wikipedia.org/wiki/… $\endgroup$ Aug 23, 2018 at 14:07


You must log in to answer this question.

Browse other questions tagged .