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

debugging the problem on sphere, with debug prints

Browse Source
This commit is contained in:
PavelMikus 2022-11-29 16:58:38 +01:00 committed by Pavel Mikuš
parent f823da9f38
commit 5b834f3439
1 changed files with 8 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
src/libslic3r/GCode/ExtrusionProcessor.hpp
View File

@ -161,7 +161,7 @@ public:
}; };
float flow_width = path.width; float flow_width = path.width;
float min_malformation_dist = 0.2; float min_malformation_dist = 0.0;
const Points &original_points = path.polyline.points; const Points &original_points = path.polyline.points;
std::vector<ExtendedPoint> points; std::vector<ExtendedPoint> points;
@ -174,22 +174,24 @@ public:
if ((points.back().distance > min_malformation_dist) != if ((points.back().distance > min_malformation_dist) !=
(distance_of_next > min_malformation_dist)) { // not same sign, so one is grounded, one not (distance_of_next > min_malformation_dist)) { // not same sign, so one is grounded, one not
auto intersections = prev_layer_boundary.intersections_with_line<true>({points.back().position, next_point_pos}); auto intersections = prev_layer_boundary.intersections_with_line<true>({points.back().position, next_point_pos});
for (const auto &intersection : intersections) { points.push_back({intersection, 0.0f, 1.0}); } // for (const auto &intersection : intersections) { points.push_back({intersection, 0.0f, 1.0}); }
} }
points.push_back({next_point_pos, distance_of_next, 1.0}); points.push_back({next_point_pos, distance_of_next, 1.0});
} }
std::cout << "EXTR" << std::endl;
for (int point_idx = 0; point_idx < int(points.size()) - 1; ++point_idx) { for (int point_idx = 0; point_idx < int(points.size()) - 1; ++point_idx) {
ExtendedPoint &a = points[point_idx]; ExtendedPoint &a = points[point_idx];
ExtendedPoint &b = points[point_idx+1]; ExtendedPoint &b = points[point_idx + 1];
if (a.distance < min_malformation_dist && b.distance < min_malformation_dist) { if (a.distance < min_malformation_dist && b.distance < min_malformation_dist) {
a.quality = 1.0; a.quality = 1.0;
cestim.reset(); cestim.reset();
continue; continue;
} }
float distance = fmax(a.distance, b.distance); float distance = fmax(a.distance, b.distance);
float distance_quality = 1.0f - fmin(1.0f, distance - min_malformation_dist); std::cout << "distance: " << distance << std::endl;
float distance_quality = 1.0f - fmin(1.0f, distance);
// int prev_point_idx = point_idx; // int prev_point_idx = point_idx;
// while (prev_point_idx > 0) { // while (prev_point_idx > 0) {