/sci/ - Science & Math » Thread #13475339

5KiB, 580x163, polygon union.png

View Same Google iqdb SauceNAO

Boolean operation on polygons

Anonymous Thu 05 Aug 12:43:57 2021 No.13475339 View Reply Original Report

Quoted By: >>13475348

Searching for an algorithm to union two polygons with known vertices. Does anyone have a clue about this?

Anonymous

Anonymous Thu 05 Aug 2021 12:45:41 No.13475348 Report

Quoted By: >>13475354

>>13475339
Check the source repos of software that does this. FreeCAD for example.

Anonymous

Anonymous Thu 05 Aug 2021 12:48:02 No.13475354 Report

Quoted By:

>>13475348
>FreeCAD
Will look into it. I mean it sounds easy but i've literally spent months thinking and trying to solve this.

Anonymous

Anonymous Thu 05 Aug 2021 13:06:33 No.13475398 Report

Quoted By: >>13479541

1. Find intersecting edges.
2. Create verted for each intersecting edge
3. For each vertex in Poly2, if vertex is inside Poly1 then remove vertex.
4. Poly3 vertices = Poly1 vertices + remaining Poly2 vertices.
5. Poly3 edges = convex hull(Poly3 vertices)

Anonymous

Anonymous Fri 06 Aug 2021 07:11:51 No.13479541 Report

Quoted By:

>>13475398
>5
lmao that dovetail is concaving

Capcode	All Only User Posts Only Moderator Posts Only Admin Posts Only Developer Posts
Show Posts	All Only With Images Only Without Images
Deleted Posts	All Only Deleted Posts Only Non-Deleted Posts
Ghost Posts	All Only Ghost Posts Only Non-Ghost Posts
Post Type	All Only Sticky Threads Only Opening Posts Only Reply Posts
Results	All Grouped By Threads
Order	Latest Posts First Oldest Posts First

Your latest searches