iGoX/OrcaSlicer-bambulab
1
0
Fork 0
mirror of https://github.com/FULU-Foundation/OrcaSlicer-bambulab.git synced 2026-08-23 04:23:26 +02:00
Code Issues Packages Projects Releases Wiki Activity
10,828 Commits 4 Branches 1 Tag
d06831076d1cbd915d7dd236be44ae4ade9df200
Commit Graph
3 Commits
Author SHA1 Message Date
bubnikv d06831076d WIP: Consolidation of shortest path calculations, 
various chaining algorithms are replaced with the improved TSP
algorithm.
 2019-09-26 17:30:03 +02:00
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