4 commits

Author	SHA1	Message	Date
bubnikv	85ea0396a4	Merge branch 'master' of https://github.com/Prusa3d/PrusaSlicer	2019-09-27 18:23:36 +02:00
bubnikv	331c187b39	Rest of the path chaining has been replaced with the new algorithm. ... PolylineCollection.cpp/hpp was removed, use Polylines instead. Various first_point() / last_point() now return references, not copies.	2019-09-27 18:17:21 +02:00
Lukas Matena	d57a09558e	Several fixes of previous commits related to KDTreeIndirect.hpp and ShortestPath.cpp/.hpp	2019-09-27 13:30:07 +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