Join multiple closed polygons in one line

Hello,

I am looking for a way to optimize my machining time (engraving on wood). Do you think it is possible to join the closed polygons in one line? It seems complicated to find such an algorithm but some of you may know this case?

Do you have any ideas to start with ?

Thank you

Pierre

Attachments:

voronoi.3dm, 107 KB

Replies to This Discussion

Permalink Reply by Petras Vestartas on May 8, 2017 at 4:37am

Graphs: Travelling Salesman Problem or Hamiltonian Path

Permalink Reply by Mateusz Zwierzycki on May 8, 2017 at 6:24am

I would state those will be optimal only in specific cases. IMHO a simple greedy method could work quite as fast.. greedy means: after each curve milled go to the next closest one. Given the case in the picture, imagine how many dry runs you have to do to mill the leftovers.

Permalink Reply by Petras Vestartas on May 8, 2017 at 8:39am

Can you give a reference for IMHO?

Permalink Reply by Mateusz Zwierzycki on May 8, 2017 at 6:02pm

http://www.urbandictionary.com/define.php?term=IMHO

Permalink Reply by Michael Pryor on May 8, 2017 at 9:10pm

And to think I thought the H meant "honest". Never know what you will learn on the GH forum :D

Permalink Reply by Laurent DELRIEU on May 13, 2017 at 4:11pm

I did give a try with Mateusz idea. So here a short script which begin by a curve you specify, go to the end find the closest curve which wasn't carved, take it and so on. If the curve doesn't touch with Rhino tolerance, go up first and and travel il straight line and go back. I output 2 types of paths :

A : with multiple curves with good orientation.

B : a single path, but doesn't work with closed curve.

The sphere is the begin of the path. Cones represent direction.

Attachments: