0
$\begingroup$

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

$\endgroup$

1 Answer 1

1
$\begingroup$

Sounds like you’re looking for a way to do a Boolean union operation. There’s a couple of algorithms linked from that article that should do the trick.

$\endgroup$
2
  • 1
    $\begingroup$ 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 : computergraphics.meta.stackexchange.com/questions/98 ) $\endgroup$ Commented Dec 7, 2017 at 20:00
  • 1
    $\begingroup$ @SebastiánMestre: This is not a link-only answer, as it gives the key term: Boolean union operation. If the link goes down, future visitors can look up Boolean unions in any computational geometry textbook. It would be a link-only answer if what it said was, "Check this link, the answer to your question is in there". $\endgroup$
    – user106
    Commented Dec 8, 2017 at 3:04

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.