How do I combine complex polygons?

Given two polygons:

POLYGON((1 0, 1 8, 6 4, 1 0))
POLYGON((4 1, 3 5, 4 9, 9 5, 4 1),(4 5, 5 7, 6 7, 4 4, 4 5))

How can I calculate the union (combined polygon)?

Dave's example uses SQL server to produce the union, but I need to accomplish the same in code. I'm looking for a mathematical formula or code example in any language that exposes the actual math. I am attempting to produce maps that combine countries dynamically into regions. I asked a related question here: https://stackoverflow.com/questions/2653812/grouping-geographical-shapes

This is a very good question. I implemented the same algorithm on c# some time ago. The Algorithm constructs a common contour of two polygons (i.e. Constructs a union without holes). Here it is.

---

Step 1. Create graph that describes the polygons.

Input: first polygon (n points), second polygon (m points). Output: graph. Vertex - polygon point of intersection point.

We should find intersections. Iterate through all polygon sides in both polygons [O(n*m)] and find any intersections.

• If an intersection is not found, simply add vertices and connect them to the edge.

• If any intersections are found, sort them by length to their start point, add all vertexes (start, end and intersections) and connect them (already in sorted order) to the edge.

Step 2. Check constructed graph

If we did not find any intersection points when graph was built, we have one of the following conditions:

1. Polygon1 contains polygon2 - return polygon1
2. Polygon2 contains polygon1 - return polygon2
3. Polygon1 and polygon2 do not intersect. Return polygon1 AND polygon2.

Step 3. Find left-bottom vertex.

Find the minimum x and y coordinates (minx, miny). Then find the minimum distance between (minx, miny) and the polygon's points. This point will be the left-bottom point.

Step 4. Construct common contour.

We start to traverse the graph from the left-bottom point and continue until we get back into it. At the beginning we mark all edges as unvisited. On every iteration you should select the next point and mark it as visited.

To choose the next point, choose an edge with a maximum internal angle in counter-clockwise direction.

I calculate two vectors: vector1 for current edge and vector2 for each next unvisited edge (as presented in the picture).

For vectors I calculate:

1. Scalar product (dot product). It returns a value related to an angle between vectors.
2. Vector product (cross product). It returns a new vector. If z-coordinate of this vector is positive, scalar product gives me right angle in counter-clockwise direction. Else (z-coordinate is negative), I calculate get angle between vectors as 360 - angle from scalar product.

As a result I get an edge (and a correspond next vertex) with the maximum angle.

I add to result list each passed vertex. Result list is the union polygon.

Remarks

1. This algorithm allows us to merge multiple of polygons - to apply iteratively with polygon's pairs.
2. If you have a path that consists of many bezier curves and lines, you should flatten this path first.

This is a challenging but well-understood topic, that often goes under the name "regularized Boolean operations on polygons." You might look at this MathOverflow answer, which includes the figure below (from Alan Murta's clipping library), with the pink union the OP's combine:

---

     

---

You need to determine which points lie inside. After removing these points, you can insert one set of "outside" points into the other. Your insertion points (e.g. where you have the arrow in the picture on the right) are where you had to remove points from the input sets.

Good question! I've never attempted this before, but I'll take a crack at it now.

First: You need to know where these two shapes overlap. To do this, you could look at every edge in Polygon A and see where it intersects and edge in Polygon B. In this example, there should be two points of intersection.

Then: Make the union shape. You can take all of the vertices in A and B, and also the points of intersection, and then exclude the vertices that contained by the final shape. To find these points, it looks like you could just find any vertex of A that is inside B, and any vertext of B that is inside A.

Try gpc.

I have faced the same problem and I solved the problem by using the following way

Cython wrapper for the C++ translation of the Angus Johnson's Clipper library (ver. 6.4.2) https://github.com/fonttools/pyclipper

pc = pyclipper.Pyclipper()
def get_poly_union(polygons):
    pc.AddPaths(polygons, pyclipper.PT_SUBJECT, True)
    solution = pc.Execute(pyclipper.CT_UNION, pyclipper.PFT_NONZERO, pyclipper.PFT_NONZERO)
    return solution[0]

print_image = image.copy()
solution = get_poly_union(polygons_array) 
#polygons_array=[polygon,polygon,polygon, ...,polygon] and polygon=[point,point,point...,point]

cv2.drawContours(print_image, [np.asarray(solution)], -1, (0, 255, 0), 2)

plt.imshow(print_image)

A solution I've seen using BSP trees is described here.

Basically, it describes intersection in terms of a union of the edges of polygon A that are inside polygon B (including partial edges, and calculated using a BSP tree). Then, you can define A / B as (A / ~B), where ~ denotes reversing the winding of the polygon, / denotes union and /\ denotes intersection.

This is very old question but Union_ function from Boost worked for me.

See this snippet below:

#include <iostream>
#include <vector>

#include <boost/geometry.hpp>
#include <boost/geometry/geometries/point_xy.hpp>
#include <boost/geometry/geometries/polygon.hpp>

#include <boost/foreach.hpp>


int main()
{
	typedef boost::geometry::model::polygon<boost::geometry::model::d2::point_xy<double> > polygon;

	polygon green, blue;

	boost::geometry::read_wkt(
		"POLYGON((0 0, 0 10, 10 10, 10 0, 0 0))", green);

	boost::geometry::read_wkt(
		"POLYGON((5 5, 5 15, 15 15, 15 5, 5 5))", blue);

	std::vector<polygon> output;
	boost::geometry::union_(green, blue, output);

	int i = 0;
	std::cout << "green || blue:" << std::endl;
	BOOST_FOREACH(polygon const& p, output)
	{
		std::cout << i++ << ": " << boost::geometry::area(p) << std::endl;

		for (int i = 0; i < p.outer().size(); i++)
		{
			std::cout << p.outer().at(i).x() << " " << p.outer().at(i).y() << std::endl;
		}
	}



	return 0;
}

When grouping countries, I'd hope there be no overlap -- you could take a fairly naive algorithm that looks for shared vertices - a simple view would be to iterate through the points on one polygon, see if it's on any of your other polygons, and shares the same next or previous point to see if there is a match. Then just remove the shared vertex to create your union

I needed to solve this same problem today and found the solution with this lib: http://www.cs.man.ac.uk/~toby/alan/software/.

It have a lot of language implementations the list here including Java, Obj-C, C#, Lua, python and more.