135 lines
5.3 KiB
C++
135 lines
5.3 KiB
C++
#include "spatial/spatial.h"
|
|
#include <iostream>
|
|
#include <cassert>
|
|
#include <cmath>
|
|
|
|
using namespace metin2::spatial;
|
|
|
|
void TestMathPrimitives() {
|
|
std::cout << "[Test] Vector3 & AABB & Frustum Primitives...\n";
|
|
Vector3 a(1, 2, 3);
|
|
Vector3 b(4, 5, 6);
|
|
assert(a.Dot(b) == 32.0f);
|
|
|
|
Vector3 cross = Vector3(1, 0, 0).Cross(Vector3(0, 1, 0));
|
|
assert(std::abs(cross.z - 1.0f) < 1e-5f);
|
|
|
|
AABB box(Vector3(-10, -10, -10), Vector3(10, 10, 10));
|
|
assert(box.Contains(Vector3(0, 0, 0)));
|
|
assert(!box.Contains(Vector3(20, 0, 0)));
|
|
|
|
AABB other(Vector3(5, 5, 5), Vector3(15, 15, 15));
|
|
assert(box.Intersects(other));
|
|
|
|
// Perspective Frustum
|
|
Vector3 eye(0, 100, -500);
|
|
Vector3 look(0, 0, 1);
|
|
Vector3 up(0, 1, 0);
|
|
Frustum frustum = Frustum::CreatePerspective(eye, look, up, 60.0f, 16.0f / 9.0f, 1.0f, 2000.0f);
|
|
|
|
AABB in_front(Vector3(-50, 50, 200), Vector3(50, 150, 300));
|
|
assert(frustum.Intersects(in_front));
|
|
|
|
AABB behind_camera(Vector3(-50, 50, -1000), Vector3(50, 150, -800));
|
|
assert(!frustum.Intersects(behind_camera));
|
|
|
|
std::cout << " -> Math primitives passed!\n";
|
|
}
|
|
|
|
void TestLooseOctreeDynamicOperations() {
|
|
std::cout << "[Test] Loose Octree Dynamic Insertion, Update & Removal...\n";
|
|
AABB world(Vector3(-50000, -5000, -50000), Vector3(50000, 10000, 50000));
|
|
LooseOctree octree(world, 2.0f, 5, 8);
|
|
|
|
// Insert 3 objects: Building (1), Tree (2), Monster (3)
|
|
assert(octree.Insert(1, SpatialObjectType::Building, AABB(Vector3(100, 0, 100), Vector3(300, 400, 300))));
|
|
assert(octree.Insert(2, SpatialObjectType::Tree, AABB(Vector3(-200, 0, 500), Vector3(-150, 600, 550))));
|
|
assert(octree.Insert(3, SpatialObjectType::Monster, AABB(Vector3(10, 0, 10), Vector3(30, 80, 30))));
|
|
|
|
assert(octree.Size() == 3);
|
|
assert(octree.Contains(1));
|
|
assert(octree.Contains(2));
|
|
assert(octree.Contains(3));
|
|
|
|
// Cannot insert duplicate ID
|
|
assert(!octree.Insert(1, SpatialObjectType::Building, AABB(Vector3(0, 0, 0), Vector3(10, 10, 10))));
|
|
|
|
// Update object 3 position
|
|
assert(octree.Update(3, AABB(Vector3(500, 0, 500), Vector3(520, 80, 520))));
|
|
assert(octree.Size() == 3);
|
|
|
|
// Remove object 2
|
|
assert(octree.Remove(2));
|
|
assert(!octree.Contains(2));
|
|
assert(octree.Size() == 2);
|
|
|
|
std::cout << " -> Loose Octree operations passed!\n";
|
|
}
|
|
|
|
void TestFrustumCullingAndDistanceSort() {
|
|
std::cout << "[Test] Frustum Culling & Distance Sorting...\n";
|
|
AABB world(Vector3(-10000, -1000, -10000), Vector3(10000, 2000, 10000));
|
|
LooseOctree octree(world);
|
|
|
|
// Insert objects along the Z-axis
|
|
// Camera is at (0, 0, 0), looking forward (0, 0, 1)
|
|
octree.Insert(10, SpatialObjectType::Tree, AABB(Vector3(-10, 0, 500), Vector3(10, 200, 520))); // In front (500 units)
|
|
octree.Insert(20, SpatialObjectType::Tree, AABB(Vector3(-10, 0, 100), Vector3(10, 200, 120))); // In front (100 units, closer)
|
|
octree.Insert(30, SpatialObjectType::Tree, AABB(Vector3(-10, 0, 1500), Vector3(10, 200, 1520)));// In front (1500 units, farther)
|
|
octree.Insert(40, SpatialObjectType::Building, AABB(Vector3(-10, 0, -500), Vector3(10, 200, -480))); // Behind camera
|
|
octree.Insert(50, SpatialObjectType::Building, AABB(Vector3(3000, 0, 200), Vector3(3200, 200, 220))); // Way off to the right
|
|
|
|
Vector3 cam_pos(0, 10, 0);
|
|
Frustum frustum = Frustum::CreatePerspective(cam_pos, Vector3(0, 0, 1), Vector3(0, 1, 0), 60.0f, 1.0f, 10.0f, 2000.0f);
|
|
|
|
auto visible = octree.QueryFrustum(frustum, cam_pos, true);
|
|
|
|
// Expected: 20, 10, 30 are visible in order of distance; 40 and 50 are culled!
|
|
assert(visible.size() == 3);
|
|
assert(visible[0].id == 20); // ~110 units
|
|
assert(visible[1].id == 10); // ~510 units
|
|
assert(visible[2].id == 30); // ~1510 units
|
|
assert(visible[0].distance < visible[1].distance);
|
|
assert(visible[1].distance < visible[2].distance);
|
|
|
|
std::cout << " -> Frustum culling and distance sort verified!\n";
|
|
}
|
|
|
|
void TestSphereQueryAndRaycast() {
|
|
std::cout << "[Test] Sphere AOE Query & Raycast...\n";
|
|
AABB world(Vector3(-10000, -1000, -10000), Vector3(10000, 2000, 10000));
|
|
LooseOctree octree(world);
|
|
|
|
octree.Insert(100, SpatialObjectType::Monster, AABB(Vector3(0, 0, 100), Vector3(20, 50, 120)));
|
|
octree.Insert(200, SpatialObjectType::Monster, AABB(Vector3(0, 0, 300), Vector3(20, 50, 320)));
|
|
octree.Insert(300, SpatialObjectType::Building, AABB(Vector3(500, 0, 500), Vector3(600, 300, 600)));
|
|
|
|
// Sphere query around (0, 0, 100) with radius 150
|
|
auto sphere_hits = octree.QuerySphere(Vector3(10, 25, 110), 100.0f);
|
|
assert(sphere_hits.size() == 1);
|
|
assert(sphere_hits[0] == 100);
|
|
|
|
// Raycast: shoot ray straight down Z axis from (10, 25, 0) towards +Z
|
|
Ray ray;
|
|
ray.origin = Vector3(10, 25, 0);
|
|
ray.direction = Vector3(0, 0, 1);
|
|
|
|
RaycastHit hit;
|
|
bool found = octree.Raycast(ray, hit);
|
|
assert(found);
|
|
assert(hit.object_id == 100);
|
|
assert(hit.distance >= 99.0f && hit.distance <= 101.0f);
|
|
|
|
std::cout << " -> Sphere query and Raycast verified!\n";
|
|
}
|
|
|
|
int main() {
|
|
std::cout << "=== Running Metin2 Spatial Octree SDK Tests ===\n";
|
|
TestMathPrimitives();
|
|
TestLooseOctreeDynamicOperations();
|
|
TestFrustumCullingAndDistanceSort();
|
|
TestSphereQueryAndRaycast();
|
|
std::cout << "All Spatial Octree SDK Tests PASSED!\n";
|
|
return 0;
|
|
}
|