Union of two polygons defined by paths

Question

I have two polygons which are defined by a list of points:

x1,y1; x2,y2; x3,y3; ...; xn,yn

and I would like to find their union, expressed in the same form.

It would be acceptable to assume that the two overlap leaving no holes. Better, for generality, would be to allow the two polygons to have holes but to fill them in.

Speed is not important in this application; an inefficient algorithm/implementation would be fine. I'm open to any type of answer: a library which solves the task, a, algorithm, or code.

Possible duplicate: http://stackoverflow.com/questions/2667748/union-of-complex-polygons — NominSim, Jun 19 '12 at 14:28
Or of http://stackoverflow.com/questions/1526352/how-to-intersect-two-polygons — High Performance Mark, Jun 19 '12 at 14:29

score 2 · Accepted Answer · answered Jun 19 '12 at 14:40

2

You can try Clipper library by Angus Johnson. It may be used with C++, C# and Delphi.

answered Jun 19 '12 at 14:40

MBo

77,366
5
53
86

Union of two polygons defined by paths

1 Answers1