<p>Sounds like you’re looking for a way to do a <a href="https://en.wikipedia.org/wiki/Boolean_operations_on_polygons" rel="nofollow noreferrer">Boolean union operation</a>. There’s a couple of algorithms linked from that article that should do the trick.</p>

CC BY-SA 3.0
2017-12-07T20:00:47.513Z
Please expand a bit on how to achieve the desired result. Link only answers are not encouraged here. If you link goes down or the page gets modified your answer becomes empty and irrelevant for any future visitors( here is a (admittedly fairly old) meta discussion on the topic : https://computergraphics.meta.stackexchange.com/questions/98 )
Sebastián Mestre
CC BY-SA 3.0
2017-12-07T19:51:33.557Z
2017-12-07T19:51:33.557Z
Noah Witherspoon
<p>I have a bunch of intersecting convex polygons, I want to find vertices of the outer contour of all those polygons. An individual polygon is not self-intersecting.</p>

<p>Could you please tell What could be a generic way of achieving this? Is there an API to do this?</p>

<p>PS: I'm developing a CAD drawing generator using .netdxf and C#.</p>

<p>Below is a simple example</p>

<p><a href="https://i.sstatic.net/UT9G4.png" rel="nofollow noreferrer"><img src="https://i.sstatic.net/UT9G4.png" alt="enter image description here"></a></p>

<polygon><clipping>
Finding vertices of the outer contour of intersecting polygons
user3453636
# Finding vertices of the outer contour of intersecting polygons

(Asked by: username_0 on 2017-12-07)

I have a bunch of intersecting convex polygons, I want to find vertices of the outer contour of all those polygons. An individual polygon is not self-intersecting.

Could you please tell What could be a generic way of achieving this? Is there an API to do this?

PS: I'm developing a CAD drawing generator using .netdxf and C#.

Below is a simple example

[![enter image description here](https://i.sstatic.net/UT9G4.png)](https://i.sstatic.net/UT9G4.png)

**Tags:** polygon, clipping


---

## 1 answers

### Answer by username_1 on 2017-12-07. Score: 1 | Accepted answer

Sounds like you’re looking for a way to do a [Boolean union operation](https://en.wikipedia.org/wiki/Boolean_operations_on_polygons). There’s a couple of algorithms linked from that article that should do the trick.

> **Comments:**
> **username_2**: Please expand a bit on how to achieve the desired result. Link only answers are not encouraged here. If you link goes down or the page gets modified your answer becomes empty and irrelevant for any future visitors( here is a (admittedly fairly old) meta discussion on the topic : https://computergraphics.meta.stackexchange.com/questions/98 )  

---

