3DPrinting/PrusaSlicer-NonPlainar
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
10,827 Commits 1 Branch 1 Tag 249 MiB
10eecb2cab
Commit Graph

2 Commits

Author SHA1 Message Date
bubnikv
10eecb2cab Reworked Traveling Salesman Problem code for simplicity and robustness. 
The TSP algorithm is newly used for planning of the printing order
of objects AND their instances.
 2019-09-26 16:39:50 +02:00
bubnikv
41495a932a Introduction of a greedy Traveling Salesman Problem algorithm, 
producing better shortest path estimate than the "closest next neighbor"
heuristics. The new greedy algorithm utilizes KD tree for closest
end point search, and builds a graph to detect loops.

PerimeterGenerator newly uses the optimized TSP algorithm.

ExtrusionEntity has been refactored / simplified.
 2019-09-26 09:44:38 +02:00