mirror of
https://github.com/FULU-Foundation/OrcaSlicer-bambulab.git
synced 2026-06-06 05:42:59 -04:00
10eecb2cab
The TSP algorithm is newly used for planning of the printing order of objects AND their instances.
28 lines
1.0 KiB
C++
28 lines
1.0 KiB
C++
#ifndef slic3r_ShortestPath_hpp_
|
|
#define slic3r_ShortestPath_hpp_
|
|
|
|
#include "libslic3r.h"
|
|
#include "ExtrusionEntity.hpp"
|
|
#include "Point.hpp"
|
|
|
|
#include <utility>
|
|
#include <vector>
|
|
|
|
namespace Slic3r {
|
|
|
|
std::vector<size_t> chain_points(const Points &points, Point *start_near = nullptr);
|
|
|
|
std::vector<std::pair<size_t, bool>> chain_extrusion_entities(std::vector<ExtrusionEntity*> &entities, const Point *start_near = nullptr);
|
|
void reorder_extrusion_entities(std::vector<ExtrusionEntity*> &entities, std::vector<std::pair<size_t, bool>> &chain);
|
|
void chain_and_reorder_extrusion_entities(std::vector<ExtrusionEntity*> &entities, const Point *start_near = nullptr);
|
|
|
|
// 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);
|
|
|
|
|
|
} // namespace Slic3r
|
|
|
|
#endif /* slic3r_ShortestPath_hpp_ */
|