3DPrinting/PrusaSlicer-NonPlainar
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
cea7cbfaa0
PrusaSlicer-NonPlainar/src/libslic3r/ShortestPath.hpp

39 lines
1.9 KiB
C++
Raw Normal View History

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 07:44:38 +00:00
#ifndef slic3r_ShortestPath_hpp_
#define slic3r_ShortestPath_hpp_
#include "libslic3r.h"
#include "ExtrusionEntity.hpp"
#include "Point.hpp"
#include <utility>
#include <vector>
WIP: Consolidation of shortest path calculations, various chaining algorithms are replaced with the improved TSP algorithm.
2019-09-26 15:30:03 +00:00
namespace ClipperLib { class PolyNode; }
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 07:44:38 +00:00
namespace Slic3r {
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 14:39:50 +00:00
std::vector<size_t> chain_points(const Points &points, Point *start_near = nullptr);
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 07:44:38 +00:00
std::vector<std::pair<size_t, bool>> chain_extrusion_entities(std::vector<ExtrusionEntity*> &entities, const Point *start_near = nullptr);
Several fixes of previous commits related to KDTreeIndirect.hpp and ShortestPath.cpp/.hpp
2019-09-27 11:26:58 +00:00
void reorder_extrusion_entities(std::vector<ExtrusionEntity*> &entities, const std::vector<std::pair<size_t, bool>> &chain);
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 14:39:50 +00:00
void chain_and_reorder_extrusion_entities(std::vector<ExtrusionEntity*> &entities, const Point *start_near = nullptr);
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 16:17:21 +00:00
std::vector<std::pair<size_t, bool>> chain_extrusion_paths(std::vector<ExtrusionPath> &extrusion_paths, const Point *start_near = nullptr);
void reorder_extrusion_paths(std::vector<ExtrusionPath> &extrusion_paths, std::vector<std::pair<size_t, bool>> &chain);
void chain_and_reorder_extrusion_paths(std::vector<ExtrusionPath> &extrusion_paths, const Point *start_near = nullptr);
Merge branch 'master' of https://github.com/Prusa3d/PrusaSlicer
2019-09-27 16:23:36 +00:00
Polylines chain_polylines(Polylines &&src, const Point *start_near = nullptr);
One more try, fixing a missing parameter.
2019-09-27 17:07:07 +00:00
inline Polylines chain_polylines(const Polylines& src, const Point* start_near = nullptr) { Polylines tmp(src); return chain_polylines(std::move(tmp), start_near); }
Fix of G-code path planning: Infill lines were incorrectly ordered for islands with another islands in their holes. Improvement of chaining of infill lines for 3D honeycomb, Gyroid and Honeycomb infill: New TSP chaining algorithm is used.
2019-09-27 07:51:07 +00:00
WIP: Consolidation of shortest path calculations, various chaining algorithms are replaced with the improved TSP algorithm.
2019-09-26 15:30:03 +00:00
std::vector<ClipperLib::PolyNode*> chain_clipper_polynodes(const Points &points, const std::vector<ClipperLib::PolyNode*> &items);
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 14:39:50 +00:00
// Chain instances of print objects by an approximate shortest path.
// Returns pairs of PrintObject idx and instance of that PrintObject.
class Print;
std::vector<std::pair<size_t, size_t>> chain_print_object_instances(const Print &print);
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 07:44:38 +00:00
} // namespace Slic3r
#endif /* slic3r_ShortestPath_hpp_ */
Reference in New Issue Copy Permalink