-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_octree.cpp
More file actions
343 lines (268 loc) · 10.5 KB
/
test_octree.cpp
File metadata and controls
343 lines (268 loc) · 10.5 KB
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
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
#include "catch.hpp"
#include "../src/Caffeine.hpp"
#include <cmath>
using namespace Caffeine;
using namespace Caffeine::Spatial;
using namespace Caffeine::ECS;
static constexpr f32 kEps = 0.001f;
// ============================================================================
// AABB3D Tests
// ============================================================================
TEST_CASE("AABB3D - center and size", "[spatial][aabb]") {
AABB3D box{{0, 0, 0}, {4, 6, 8}};
Vec3 c = box.center();
REQUIRE(c.x == Approx(2.0f));
REQUIRE(c.y == Approx(3.0f));
REQUIRE(c.z == Approx(4.0f));
Vec3 s = box.size();
REQUIRE(s.x == Approx(4.0f));
REQUIRE(s.y == Approx(6.0f));
REQUIRE(s.z == Approx(8.0f));
}
TEST_CASE("AABB3D - contains point", "[spatial][aabb]") {
AABB3D box{{-2, -2, -2}, {2, 2, 2}};
REQUIRE(box.contains({0, 0, 0}));
REQUIRE(box.contains({2, 2, 2}));
REQUIRE(box.contains({-2, -2, -2}));
REQUIRE_FALSE(box.contains({3, 0, 0}));
REQUIRE_FALSE(box.contains({0, 5, 0}));
REQUIRE_FALSE(box.contains({0, 0, -3}));
}
TEST_CASE("AABB3D - contains AABB", "[spatial][aabb]") {
AABB3D outer{{-5, -5, -5}, {5, 5, 5}};
AABB3D inner{{-1, -1, -1}, {1, 1, 1}};
REQUIRE(outer.contains(inner));
REQUIRE_FALSE(inner.contains(outer));
}
TEST_CASE("AABB3D - intersects", "[spatial][aabb]") {
AABB3D a{{0, 0, 0}, {4, 4, 4}};
AABB3D overlapping{{2, 2, 2}, {6, 6, 6}};
AABB3D separate{{10, 10, 10}, {14, 14, 14}};
AABB3D touching{{4, 0, 0}, {8, 4, 4}};
REQUIRE(a.intersects(overlapping));
REQUIRE_FALSE(a.intersects(separate));
REQUIRE(a.intersects(touching));
}
TEST_CASE("AABB3D - intersectsRay", "[spatial][aabb]") {
AABB3D box{{-1, -1, -1}, {1, 1, 1}};
f32 t = -1.0f;
REQUIRE(box.intersectsRay({-5, 0, 0}, {1, 0, 0}, &t));
REQUIRE(t == Approx(4.0f));
REQUIRE_FALSE(box.intersectsRay({-5, 10, 0}, {1, 0, 0}));
REQUIRE(box.intersectsRay({0, 0, 0}, {1, 0, 0}, &t));
REQUIRE(t == Approx(0.0f));
}
// ============================================================================
// Frustum Tests
// ============================================================================
TEST_CASE("Frustum - contains point", "[spatial][frustum]") {
f32 aspect = 16.0f / 9.0f;
Frustum f = Frustum::fromCamera(
{0, 0, -5}, {0, 0, 0}, {0, 1, 0},
Math::degToRad(60.0f), aspect, 0.1f, 100.0f
);
REQUIRE(f.contains({0, 0, 0}));
REQUIRE(f.contains({0, 0, -2}));
REQUIRE(f.contains({0, 0, 10}));
REQUIRE_FALSE(f.contains({0, 0, 200}));
REQUIRE_FALSE(f.contains({100, 0, 0}));
}
TEST_CASE("Frustum - intersects AABB", "[spatial][frustum]") {
f32 aspect = 16.0f / 9.0f;
Frustum f = Frustum::fromCamera(
{0, 0, -5}, {0, 0, 0}, {0, 1, 0},
Math::degToRad(60.0f), aspect, 0.1f, 100.0f
);
REQUIRE(f.intersects(AABB3D{{-1, -1, -1}, {1, 1, 1}}));
REQUIRE_FALSE(f.intersects(AABB3D{{-1, -1, 150}, {1, 1, 200}}));
REQUIRE(f.intersects(AABB3D{{-200, -200, -2}, {200, 200, 2}}));
}
TEST_CASE("Frustum - containsSphere", "[spatial][frustum]") {
f32 aspect = 16.0f / 9.0f;
Frustum f = Frustum::fromCamera(
{0, 0, -5}, {0, 0, 0}, {0, 1, 0},
Math::degToRad(60.0f), aspect, 0.1f, 100.0f
);
REQUIRE(f.containsSphere({0, 0, 0}, 1.0f));
REQUIRE_FALSE(f.containsSphere({0, 0, 200}, 10.0f));
}
// ============================================================================
// Octree Tests
// ============================================================================
TEST_CASE("Octree - construction and empty queries", "[spatial][octree]") {
Octree octree({{{-100, -100, -100}, {100, 100, 100}}});
REQUIRE(octree.nodeCount() == 1);
REQUIRE(octree.entityCount() == 0);
REQUIRE(octree.depth() == 0);
std::vector<ECS::Entity> result;
octree.queryAABB({{-10, -10, -10}, {10, 10, 10}}, result);
REQUIRE(result.empty());
octree.queryFrustum(Frustum{}, result);
REQUIRE(result.empty());
octree.queryRay({0, 0, 0}, {1, 0, 0}, 100.0f, result);
REQUIRE(result.empty());
octree.queryRadius({0, 0, 0}, 10.0f, result);
REQUIRE(result.empty());
}
TEST_CASE("Octree - insert and entityCount", "[spatial][octree]") {
Octree octree({{{-100, -100, -100}, {100, 100, 100}}, 4, 8});
ECS::Entity e1(1, nullptr);
ECS::Entity e2(2, nullptr);
ECS::Entity e3(3, nullptr);
octree.insert(e1, {{-10, -10, -10}, {10, 10, 10}});
REQUIRE(octree.entityCount() == 1);
octree.insert(e2, {{20, 20, 20}, {30, 30, 30}});
REQUIRE(octree.entityCount() == 2);
octree.insert(e3, {{-50, -50, -50}, {-40, -40, -40}});
REQUIRE(octree.entityCount() == 3);
}
TEST_CASE("Octree - subdivision", "[spatial][octree]") {
Octree octree({{{-100, -100, -100}, {100, 100, 100}}, 4, 4});
std::vector<ECS::Entity> entities;
for (u32 i = 0; i < 20; ++i) {
entities.emplace_back(i, nullptr);
f32 x = (f32)(i * 10) - 50.0f;
octree.insert(entities.back(), {{x - 2, -2, -2}, {x + 2, 2, 2}});
}
REQUIRE(octree.entityCount() == 20);
REQUIRE(octree.nodeCount() > 1);
REQUIRE(octree.depth() >= 1);
}
TEST_CASE("Octree - remove", "[spatial][octree]") {
Octree octree({{{-100, -100, -100}, {100, 100, 100}}, 4, 8});
ECS::Entity e1(1, nullptr);
ECS::Entity e2(2, nullptr);
octree.insert(e1, {{-5, -5, -5}, {5, 5, 5}});
octree.insert(e2, {{10, 10, 10}, {20, 20, 20}});
REQUIRE(octree.entityCount() == 2);
octree.remove(e1);
REQUIRE(octree.entityCount() == 1);
octree.remove(ECS::Entity(999, nullptr));
REQUIRE(octree.entityCount() == 1);
}
TEST_CASE("Octree - update", "[spatial][octree]") {
Octree octree({{{-100, -100, -100}, {100, 100, 100}}, 4, 8});
ECS::Entity e(1, nullptr);
octree.insert(e, {{-10, -10, -10}, {10, 10, 10}});
REQUIRE(octree.entityCount() == 1);
octree.update(e, {{50, 50, 50}, {60, 60, 60}});
REQUIRE(octree.entityCount() == 1);
std::vector<ECS::Entity> result;
octree.queryAABB({{-15, -15, -15}, {15, 15, 15}}, result);
REQUIRE(result.empty());
octree.queryAABB({{45, 45, 45}, {65, 65, 65}}, result);
REQUIRE(result.size() == 1);
}
TEST_CASE("Octree - queryAABB", "[spatial][octree]") {
Octree octree({{{-100, -100, -100}, {100, 100, 100}}, 4, 8});
ECS::Entity e1(1, nullptr);
ECS::Entity e2(2, nullptr);
octree.insert(e1, {{-2, -2, -2}, {2, 2, 2}});
octree.insert(e2, {{80, 80, 80}, {90, 90, 90}});
std::vector<ECS::Entity> result;
octree.queryAABB({{-5, -5, -5}, {5, 5, 5}}, result);
REQUIRE(result.size() == 1);
REQUIRE(result[0] == e1);
result.clear();
octree.queryAABB({{70, 70, 70}, {95, 95, 95}}, result);
REQUIRE(result.size() == 1);
REQUIRE(result[0] == e2);
result.clear();
octree.queryAABB({{-100, -100, -100}, {100, 100, 100}}, result);
REQUIRE(result.size() == 2);
}
TEST_CASE("Octree - queryAABB with subdivision", "[spatial][octree]") {
Octree octree({{{-100, -100, -100}, {100, 100, 100}}, 2, 4});
std::vector<ECS::Entity> entities;
for (u32 i = 0; i < 8; ++i) {
entities.emplace_back(i, nullptr);
f32 off = (f32)(i % 4) * 5.0f;
octree.insert(entities.back(), {{off, off, off}, {off + 2, off + 2, off + 2}});
}
std::vector<ECS::Entity> result;
octree.queryAABB({{-1, -1, -1}, {3, 3, 3}}, result);
REQUIRE(result.size() >= 1);
REQUIRE(octree.entityCount() == 8);
REQUIRE(octree.nodeCount() > 1);
}
TEST_CASE("Octree - queryFrustum", "[spatial][octree]") {
Octree octree({{{-100, -100, -100}, {100, 100, 100}}, 4, 8});
ECS::Entity e1(1, nullptr);
ECS::Entity e2(2, nullptr);
octree.insert(e1, {{-1, -1, -1}, {1, 1, 1}});
octree.insert(e2, {{-50, -50, 50}, {-40, -40, 60}});
f32 aspect = 16.0f / 9.0f;
Frustum frustum = Frustum::fromCamera(
{0, 0, -5}, {0, 0, 0}, {0, 1, 0},
Math::degToRad(60.0f), aspect, 0.1f, 100.0f
);
std::vector<ECS::Entity> result;
octree.queryFrustum(frustum, result);
REQUIRE(result.size() >= 1);
}
TEST_CASE("Octree - queryRadius", "[spatial][octree]") {
Octree octree({{{-100, -100, -100}, {100, 100, 100}}, 4, 8});
ECS::Entity e1(1, nullptr);
ECS::Entity e2(2, nullptr);
octree.insert(e1, {{-1, -1, -1}, {1, 1, 1}});
octree.insert(e2, {{80, 80, 80}, {90, 90, 90}});
std::vector<ECS::Entity> result;
octree.queryRadius({0, 0, 0}, 10.0f, result);
REQUIRE(result.size() == 1);
REQUIRE(result[0] == e1);
result.clear();
octree.queryRadius({0, 0, 0}, 200.0f, result);
REQUIRE(result.size() == 2);
}
TEST_CASE("Octree - queryRay", "[spatial][octree]") {
Octree octree({{{-100, -100, -100}, {100, 100, 100}}, 4, 8});
ECS::Entity e1(1, nullptr);
octree.insert(e1, {{-1, -1, -1}, {1, 1, 1}});
std::vector<ECS::Entity> result;
octree.queryRay({-10, 0, 0}, {1, 0, 0}, 20.0f, result);
REQUIRE(result.size() == 1);
REQUIRE(result[0] == e1);
result.clear();
octree.queryRay({10, 0, 0}, {1, 0, 0}, 20.0f, result);
REQUIRE(result.empty());
}
TEST_CASE("Octree - rebuild", "[spatial][octree]") {
Octree octree({{{-100, -100, -100}, {100, 100, 100}}, 4, 8});
std::vector<ECS::Entity> entities;
for (u32 i = 0; i < 10; ++i) {
entities.emplace_back(i, nullptr);
octree.insert(entities.back(), {{-1, -1, -1}, {1, 1, 1}});
}
REQUIRE(octree.entityCount() == 10);
u32 nodesBefore = octree.nodeCount();
(void)nodesBefore;
octree.rebuild();
REQUIRE(octree.entityCount() == 10);
REQUIRE(octree.nodeCount() >= 1);
}
TEST_CASE("Octree - max depth prevents infinite subdivision", "[spatial][octree]") {
Octree octree({{{-100, -100, -100}, {100, 100, 100}}, 2, 0});
for (u32 i = 0; i < 100; ++i) {
ECS::Entity e(i, nullptr);
octree.insert(e, {{-1, -1, -1}, {1, 1, 1}});
}
REQUIRE(octree.nodeCount() == 1);
REQUIRE(octree.entityCount() == 100);
}
TEST_CASE("Octree - entityCount consistency after insert/remove", "[spatial][octree]") {
Octree octree({{{-100, -100, -100}, {100, 100, 100}}, 3, 4});
ECS::Entity entities[20];
for (u32 i = 0; i < 20; ++i) {
entities[i] = ECS::Entity(i, nullptr);
octree.insert(entities[i], {{-50 + (f32)i * 5, -1, -1}, {-48 + (f32)i * 5, 1, 1}});
}
REQUIRE(octree.entityCount() == 20);
for (u32 i = 0; i < 10; ++i) {
octree.remove(entities[i]);
}
REQUIRE(octree.entityCount() == 10);
for (u32 i = 10; i < 20; ++i) {
octree.remove(entities[i]);
}
REQUIRE(octree.entityCount() == 0);
}