I have a set of polygons on a plane given as a series of points. Polygons can intersect with each other.
How can I find all intersections which belongs to at least two polygons?
Which algorithms can be useful?
I have a set of polygons on a plane given as a series of points. Polygons can intersect with each other.
How can I find all intersections which belongs to at least two polygons?
Which algorithms can be useful?