1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
|
//Copyright (c) 2022 Ultimaker B.V.
//CuraEngine is released under the terms of the AGPLv3 or higher.
#include <gtest/gtest.h>
#include <unordered_set>
#include "../src/settings/Settings.h" //Settings to generate walls with.
#include "../src/utils/polygon.h" //To create example polygons.
#include "../src/sliceDataStorage.h" //Sl
#include "../src/WallsComputation.h" //Unit under test.
#include "../src/InsetOrderOptimizer.h" //Unit also under test.
#define WALLS_COMPUTATION_TEST_SVG_OUTPUT
#ifdef WALLS_COMPUTATION_TEST_SVG_OUTPUT
#include "../src/utils/polygon.h"
#include <cstdlib>
#include "../src/utils/SVG.h"
#endif //WALLS_COMPUTATION_TEST_SVG_OUTPUT
namespace cura
{
/*!
* Fixture that provides a basis for testing wall computation.
*/
class WallsComputationTest : public testing::Test
{
public:
/*!
* Settings to slice with. This is linked in the walls_computation fixture.
*/
Settings settings;
/*!
* WallsComputation instance to test with. The layer index will be 100.
*/
WallsComputation walls_computation;
/*!
* Basic 10x10mm square shape to work with.
*/
Polygons square_shape;
/*!
* A rectangle enclosing two triangular holes;
*/
Polygons ff_holes;
WallsComputationTest()
: walls_computation(settings, LayerIndex(100))
{
square_shape.emplace_back();
square_shape.back().emplace_back(0, 0);
square_shape.back().emplace_back(MM2INT(10), 0);
square_shape.back().emplace_back(MM2INT(10), MM2INT(10));
square_shape.back().emplace_back(0, MM2INT(10));
ff_holes.emplace_back();
ff_holes.back().emplace_back(0, 0);
ff_holes.back().emplace_back(10000, 0);
ff_holes.back().emplace_back(10000, 5000);
ff_holes.back().emplace_back(0, 5000);
ff_holes.emplace_back();
ff_holes.back().emplace_back(1000, 1000);
ff_holes.back().emplace_back(1000, 4000);
ff_holes.back().emplace_back(4000, 2500);
ff_holes.emplace_back();
ff_holes.back().emplace_back(6000, 1000);
ff_holes.back().emplace_back(6000, 4000);
ff_holes.back().emplace_back(9000, 2500);
//Settings for a simple 2 walls, about as basic as possible.
settings.add("alternate_extra_perimeter", "false");
settings.add("fill_outline_gaps", "false");
settings.add("initial_layer_line_width_factor", "100");
settings.add("magic_spiralize", "false");
settings.add("meshfix_maximum_deviation", "0.1");
settings.add("meshfix_maximum_extrusion_area_deviation", "0.01");
settings.add("meshfix_maximum_resolution", "0.01");
settings.add("min_bead_width", "0");
settings.add("min_feature_size", "0");
settings.add("wall_0_extruder_nr", "0");
settings.add("wall_0_inset", "0");
settings.add("wall_line_count", "2");
settings.add("wall_line_width_0", "0.4");
settings.add("wall_line_width_x", "0.4");
settings.add("wall_transition_angle", "10");
settings.add("wall_transition_filter_distance", "1");
settings.add("wall_transition_filter_deviation", ".2");
settings.add("wall_transition_length", "1");
settings.add("wall_split_middle_threshold", "50");
settings.add("wall_add_middle_threshold", "50");
settings.add("wall_x_extruder_nr", "0");
settings.add("wall_distribution_count", "2");
}
};
/*!
* Tests if something is generated in the basic happy case.
*/
TEST_F(WallsComputationTest, GenerateWallsForLayerSinglePart)
{
SliceLayer layer;
layer.parts.emplace_back();
SliceLayerPart& part = layer.parts.back();
part.outline.add(square_shape);
//Run the test.
walls_computation.generateWalls(&layer);
//Verify that something was generated.
EXPECT_FALSE(part.wall_toolpaths.empty()) << "There must be some walls.";
EXPECT_GT(part.print_outline.area(), 0) << "The print outline must encompass the outer wall, so it must be more than 0.";
EXPECT_LE(part.print_outline.area(), square_shape.area()) << "The print outline must stay within the bounds of the original part.";
EXPECT_GT(part.inner_area.area(), 0) << "The inner area must be within the innermost wall. There are not enough walls to fill the entire part, so there is a positive inner area.";
EXPECT_EQ(layer.parts.size(), 1) << "There is still just 1 part.";
}
/*!
* Tests if the inner area is properly set.
*/
TEST_F(WallsComputationTest, GenerateWallsZeroWalls)
{
settings.add("wall_line_count", "0");
SliceLayer layer;
layer.parts.emplace_back();
SliceLayerPart& part = layer.parts.back();
part.outline.add(square_shape);
//Run the test.
walls_computation.generateWalls(&layer);
//Verify that there is still an inner area, outline and parts.
EXPECT_EQ(part.inner_area.area(), square_shape.area()) << "There are no walls, so the inner area (for infill/skin) needs to be the entire part.";
EXPECT_EQ(part.print_outline.area(), square_shape.area()) << "There are no walls, so the print outline encompasses the inner area exactly.";
EXPECT_EQ(part.outline.area(), square_shape.area()) << "The outline is not modified.";
EXPECT_EQ(layer.parts.size(), 1) << "There is still just 1 part.";
}
/*!
* Tests if the inner area is properly set.
*/
TEST_F(WallsComputationTest, WallToolPathsGetWeakOrder)
{
settings.add("wall_line_count", "5");
SliceLayer layer;
layer.parts.emplace_back();
SliceLayerPart& part = layer.parts.back();
part.outline.add(ff_holes);
//Run the test.
walls_computation.generateWalls(&layer);
const bool outer_to_inner = false;
std::vector<const ExtrusionLine*> all_paths;
for (auto& inset : part.wall_toolpaths)
for (auto& line : inset)
all_paths.emplace_back(&line);
std::unordered_set<std::pair<const ExtrusionLine*, const ExtrusionLine*>> order = InsetOrderOptimizer::getRegionOrder(all_paths, outer_to_inner);
//Verify that something was generated.
EXPECT_FALSE(part.wall_toolpaths.empty()) << "There must be some walls.";
EXPECT_GT(part.print_outline.area(), 0) << "The print outline must encompass the outer wall, so it must be more than 0.";
EXPECT_LE(part.print_outline.area(), ff_holes.area()) << "The print outline must stay within the bounds of the original part.";
EXPECT_GE(part.inner_area.area(), 0) << "The inner area can never have negative area.";
EXPECT_EQ(layer.parts.size(), 1) << "There is still just 1 part.";
#ifdef WALLS_COMPUTATION_TEST_SVG_OUTPUT
{
SVG svg("/tmp/wall_order.svg", AABB(part.outline));
for (const VariableWidthLines& inset : part.wall_toolpaths)
{
for (const ExtrusionLine& line : inset)
{
if (line.is_odd)
{
svg.writePolyline(line.toPolygon(), SVG::Color::YELLOW);
svg.writePoints(line.toPolygon(), true);
}
else
svg.writePolygon(line.toPolygon(), SVG::Color::GREEN);
}
}
svg.writePolygons(part.outline, SVG::Color::RED);
svg.writePolygons(part.inner_area, SVG::Color::YELLOW);
svg.nextLayer();
for (auto [first, second] : order)
{
if ( ! second->is_odd)
svg.writeArrow(first->front().p, (++second->begin())->p, SVG::Color::BLUE);
}
svg.nextLayer();
for (auto [first, second] : order)
{
if (second->is_odd)
svg.writeArrow(first->front().p, (++second->begin())->p, SVG::Color::MAGENTA);
}
}
#endif // WALLS_COMPUTATION_TEST_SVG_OUTPUT
size_t n_paths = 0;
for (auto& lines : part.wall_toolpaths)
for (auto& line : lines)
if ( ! line.empty())
n_paths ++;
EXPECT_GT(order.size(), 0) << "There should be ordered pairs!";
std::unordered_set<const ExtrusionLine*> has_order_info(part.wall_toolpaths.size());
for (auto [from, to] : order)
{
EXPECT_FALSE(from->is_odd) << "Odd gap filler lines are never required to go before anything.";
has_order_info.emplace(from);
has_order_info.emplace(to);
}
EXPECT_EQ(has_order_info.size(), n_paths) << "Every path should have order information.";
}
}
|
