GitHub-Proxy/PrusaSlicer
1
0
Fork 0
mirror of https://git.mirrors.martin98.com/https://github.com/prusa3d/PrusaSlicer.git synced 2025-08-16 18:05:57 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

algoritmus simplified and cleaned up.

Browse Source 
has some potential but does not cooperate with bridges
This commit is contained in:
PavelMikus 2022-02-22 10:47:35 +01:00
parent 5d44ebd040
commit 05fa9776fe
1 changed files with 18 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
src/slic3r/GUI/Gizmos/Experiment.cpp
View File

@ -26,6 +26,7 @@ struct Triangle {
float strength { 0.0 }; float strength { 0.0 };
bool supports = false; bool supports = false;
bool visited = false; bool visited = false;
bool gathering_supports = false;
}; };
inline float face_area(const stl_vertex vertex[3]) { inline float face_area(const stl_vertex vertex[3]) {
@ -43,7 +44,7 @@ inline float its_face_area(const indexed_triangle_set &its, const int face_idx)
} }
struct SupportPlacerMesh { struct SupportPlacerMesh {
const float supportable_area_budget = 200000.0; const float gather_phase_target = 3.0;
indexed_triangle_set mesh; indexed_triangle_set mesh;
std::vector<Triangle> triangles; std::vector<Triangle> triangles;
@ -85,47 +86,48 @@ struct SupportPlacerMesh {
}); });
} }
const float calculate_support_cost(float dot_product, size_t index_in_its) const {
float dot_pow = dot_product * dot_product;
float weight = (1.0 / (-1.2 * dot_pow + 2)) - 0.5;
return weight * its_face_area(mesh, index_in_its);
}
void find_support_areas() { void find_support_areas() {
for (const size_t &current_index : triangle_indexes_by_z) { for (const size_t &current_index : triangle_indexes_by_z) {
Triangle &current = triangles[current_index]; Triangle &current = triangles[current_index];
float dot_product = current.normal.dot(Vec3f::UnitZ()); float dot_product = current.normal.dot(-Vec3f::UnitZ());
std::cout << "EXP: dot_product : " << dot_product << std::endl; if (dot_product < 0.2) {
current.strength = gather_phase_target * 100.0;
if (dot_product >= 0) {
current.strength = supportable_area_budget;
current.visited = true; current.visited = true;
current.supports = false; current.supports = false;
} else { } else {
float neighbours_strength_sum = 0;
for (const auto &neighbour_index : current.neighbours) { for (const auto &neighbour_index : current.neighbours) {
const Triangle &neighbour = triangles[neighbour_index]; const Triangle &neighbour = triangles[neighbour_index];
if (!neighbour.visited) { if (!neighbour.visited) {
//not visited yet, ignore //not visited yet, ignore
continue; continue;
} else { } else {
std::cout << "EXP: neighbour visited " << std::endl; neighbours_strength_sum += neighbour.strength;
float support_cost = calculate_support_cost(dot_product, current.index_in_its);
float support_cost = -dot_product * dot_product * dot_product if (neighbour.gathering_supports || neighbour.strength < support_cost) {
* its_face_area(mesh, current.index_in_its);
std::cout << "EXP: support_cost: " << support_cost << std::endl;
std::cout << "EXP: neighbour strength " << neighbour.strength << std::endl;
if (neighbour.strength < support_cost) {
continue; continue;
} else { } else {
current.strength = neighbour.strength - support_cost; current.strength = neighbour.strength - support_cost;
current.visited = true; current.visited = true;
current.supports = false; current.supports = false;
current.gathering_supports = false;
break; break;
} }
} }
} }
if (!current.visited) { if (!current.visited) {
std::cout << "EXP: suports enforced " << std::endl;
current.supports = true; current.supports = true;
current.visited = true; current.visited = true;
current.strength = its_face_area(mesh, current.index_in_its); current.strength = neighbours_strength_sum + its_face_area(mesh, current.index_in_its);
current.gathering_supports = current.strength < gather_phase_target;
} }
} }
} }