We need your help! 🔥
Please consider disabling your ad-blocker to support this website! 🔑
We are a free, community-supported website! 🥰
We only display small unobtrusive ads which help us stay online! 💯
Thank you in advance! ❤️
We are a free, community-supported website! 🥰
We only display small unobtrusive ads which help us stay online! 💯
Thank you in advance! ❤️
TSP from Topology
Hamiltonian Cycle using a topology made by points and edges, the algorithm tries to go through all points using the edges. There is no self intersection and the path is closed.
It looks like path generated by Travelling Salesman Problem (TSP) tools
It uses an algorithm like the number 3 or 4 or 5 presented here https://stemlounge.com/animated-algorithms-for-the-traveling-salesman-problem/
Inputs
| Name | ID | Description | Type |
|---|---|---|---|
| Points | P | Points | Point |
| Points Index | FP | Point index for each Face/Branch of DataTree | Integer |
| Edges | E | Edges as curves | Curve |
| Points Index | EP | Point index for each Edge/Curve of DataTree | Integer |
| Face Eddge | FE | Edge Index for each Face | Integer |
| Edge Face | EF | Face Index for each Edge | Integer |
| Algorithm | A | Algorithm used 0 first edge, 1 last edge, 2 random edge, 3 shortest insertion, 4 farthest insertion, 5 lowest insertion | Integer |
| Seed | S | Seed | Integer |
| Tolerance | T | Tolerance | Number |
Outputs
| Name | ID | Description | Type |
|---|---|---|---|
| TSP curve | C | TSP curve | Curve |
| Points | P | List of Ordered Points | Point |
| Indexes | I | Index of points | Integer |
| Errors | E | Index of points that are not used | Integer |
Site design © Robin Rodricks.
Nautilus and associated data © 2025 Laurent Delrieu.
Rhinoceros and Grasshopper are registered trademarks of Robert McNeel & Associates.
Hosted by GitHub