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
|
//Copyright (c) 2019 Ultimaker B.V.
//CuraEngine is released under the terms of the AGPLv3 or higher.
#include <gtest/gtest.h>
#include <polyclipping/clipper.hpp>
#include <../src/utils/AABB.h>
#include <../src/utils/polygon.h>
namespace cura
{
TEST(AABBTest, TestConstructEmpty)
{
AABB empty_box;
EXPECT_FALSE(empty_box.contains(Point(0, 0))) << "Empty box shouldn't contain anything.";
EXPECT_FALSE(empty_box.contains(empty_box.getMiddle())) << "Empty box shouldn't contain anything, even it's own middle.";
EXPECT_FALSE(empty_box.hit(empty_box)) << "Empty boxes shouldn't intersect.";
empty_box.include(Point(-10, -5));
empty_box.include(Point( 5, 10));
EXPECT_TRUE(empty_box.contains(Point(0, 0))) << "The previously empty box should now contain this point.";
EXPECT_FALSE(empty_box.contains(Point(11, 5))) << "The previously empty box should now still not contain this point.";
}
TEST(AABBTest, TestConstructPoint)
{
AABB point_box(Point(-10, -5), Point(5, 10));
EXPECT_TRUE(point_box.contains(Point(0, 0))) << "Box constructed from points around the origin should contain it.";
EXPECT_FALSE(point_box.contains(Point(11, 5))) << "The box shouldn't contain a point outside of it.";
}
TEST(AABBTest, TestConstructPolygons)
{
Polygons empty_polygon;
AABB polygons_box_a(empty_polygon);
EXPECT_FALSE(polygons_box_a.contains(Point(0, 0))) << "Box constructed from empty polygon shouldn't contain anything.";
Polygons polygons;
polygons.add(Polygon(ClipperLib::Path({ ClipperLib::IntPoint{-10, -10}, ClipperLib::IntPoint{10, -10}, ClipperLib::IntPoint{-5, -5}, ClipperLib::IntPoint{-10, 10} })));
polygons.add(Polygon(ClipperLib::Path({ ClipperLib::IntPoint{11, 11}, ClipperLib::IntPoint{-11, 11}, ClipperLib::IntPoint{4, 4}, ClipperLib::IntPoint{11, -11} })));
polygons.add(Polygon(ClipperLib::Path({ ClipperLib::IntPoint{2, 2}, ClipperLib::IntPoint{2, 3}, ClipperLib::IntPoint{3, 3}, ClipperLib::IntPoint{3, 2} })));
AABB polygons_box_b(polygons);
EXPECT_TRUE(polygons_box_b.contains(Point(0, 0))) << "Polygon box should contain origin, even though origin is outside of the original polygons.";
EXPECT_TRUE(polygons_box_b.contains(Point(-7, -7))) << "Polygon box should contain point that was inside of the original polygons.";
EXPECT_FALSE(polygons_box_b.contains(Point(12, 12))) << "Polygon box should not contain point outside of the AABB of the polygon.";
}
TEST(AABBTest, TestConstructInverse)
{
AABB inverse_box(Point(5, 10), Point(-10, -5));
EXPECT_FALSE(inverse_box.contains(Point(0, 0))) << "'Inverse' box shouldn't contain anything.";
EXPECT_FALSE(inverse_box.contains(inverse_box.getMiddle())) << "'Inverse' box shouldn't contain anything, even it's own middle.";
EXPECT_FALSE(inverse_box.hit(inverse_box)) << "'Inverse' boxes shouldn't intersect.";
inverse_box.include(Point(-5, -2));
inverse_box.include(Point(2, 5));
EXPECT_TRUE(inverse_box.contains(Point(0, 0))) << "The previously 'inverse' box should now contain this point.";
EXPECT_FALSE(inverse_box.contains(Point(4, 8))) << "The previously 'inverse' box should now still not contain this point.";
}
TEST(AABBTest, TestContains)
{
AABB box(Point(-10, -5), Point(5, 10));
EXPECT_FALSE(box.contains(Point(-16, 16))) << "Box constructed from points shouldn't contain a point outside of the box.";
EXPECT_TRUE(box.contains(Point(3, 10))) << "Box constructed from points should contain a point on its edge.";
EXPECT_TRUE(box.contains(Point(5, 10))) << "Box constructed from points should contain its edge-points.";
EXPECT_TRUE(box.contains(Point(0, 0))) << "Box constructed from points should contain the origin.";
}
TEST(AABBTest, TestHit)
{
AABB box_a(Point(-10, -5), Point( 5, 10));
AABB box_b(Point( 4, 9), Point(12, 12));
AABB box_c(Point( 11, 11), Point(14, 14));
EXPECT_TRUE(box_a.hit(box_a)) << "Box should overlap itself.";
EXPECT_TRUE(box_a.hit(box_b)) << "These boxes should overlap (case AB).";
EXPECT_TRUE(box_b.hit(box_a)) << "These boxes should overlap (case BA).";
EXPECT_TRUE(box_b.hit(box_c)) << "These boxes should overlap (case BC).";
EXPECT_TRUE(box_c.hit(box_b)) << "These boxes should overlap (case CB).";
EXPECT_FALSE(box_a.hit(box_c)) << "These boxes should not overlap (case AC).";
EXPECT_FALSE(box_c.hit(box_a)) << "These boxes should not overlap (case CA).";
AABB box_d(Point(3, 10), Point(12, 12));
AABB box_e(Point(5, 10), Point(12, 12));
EXPECT_TRUE(box_a.hit(box_d)) << "Overlap-check is inclusive (case AD).";
EXPECT_TRUE(box_d.hit(box_a)) << "Overlap-check is inclusive (case DA).";
EXPECT_TRUE(box_a.hit(box_e)) << "Overlap-check is inclusive (case AE).";
EXPECT_TRUE(box_e.hit(box_a)) << "Overlap-check is inclusive (case EA).";
}
TEST(AABBTest, TestGetMiddle)
{
AABB box_a(Point(-10, -6), Point( 6, 10));
AABB box_b(Point( 4, 10), Point(12, 12));
EXPECT_EQ(box_a.getMiddle(), Point(-2, 2)) << "The middle of the AABB should be this point (case A).";
EXPECT_EQ(box_b.getMiddle(), Point( 8, 11)) << "The middle of the AABB should be this point (case B).";
}
TEST(AABBTest, TestInclude)
{
AABB box(Point(2, 2), Point(5, 10));
EXPECT_FALSE(box.contains(Point(1, 1))) << "The unexpanded (via include/point) box should not contain a point in the (future) expanded area.";
box.include(Point(0, 0));
EXPECT_TRUE(box.contains(Point(1, 1))) << "The expanded (via include/point) box should contain a point in the expanded area.";
EXPECT_FALSE(box.contains(Point(6, 9))) << "The unexpanded (via include/other) box should not contain a point in the (future) expanded area.";
box.include(AABB(Point(7, 9), Point(8, 10)));
EXPECT_TRUE(box.contains(Point(6, 9))) << "The expanded (via include/other) box should contain a point in the expanded area.";
const Point a(2, 2);
const Point b(5, 10);
AABB box2(a, b);
AABB empty;
box2.include(empty);
EXPECT_EQ(box2.min, a) << "Inclusion of an 'empty' or negative box should not change the minimum of the original.";
EXPECT_EQ(box2.max, b) << "Inclusion of an 'empty' or negative box should not change the maximum of the original.";
}
TEST(AABBTest, TestExpand)
{
AABB box(Point(-10, -5), Point(5, 10));
EXPECT_FALSE(box.contains(Point(6, 11))) << "Before expanding, the box shouldn't contain this point.";
box.expand(2);
EXPECT_TRUE(box.contains(Point(6, 11))) << "After expanding, the box should contain this point.";
box.expand(-2);
EXPECT_FALSE(box.contains(Point(6, 11))) << "After shrinking, the box shouldn't contain this point anymore.";
}
TEST(AABBTest, TestToPolygon)
{
AABB box(Point(-10, -5), Point(5, 10));
Polygon polygon = box.toPolygon();
EXPECT_EQ(polygon.area(), (box.max.X - box.min.X) * (box.max.Y - box.min.Y)) << "The polygon from the bounding box should have the same area.";
EXPECT_EQ(polygon.centerOfMass(), box.getMiddle()) << "The center of mass of an (AA) rectangle is its middle.";
}
}
|
