COSC-3P93-Project/Step 3/include/engine/math/bvh.h

133 lines
4.1 KiB
C
Raw Normal View History

2022-10-20 11:30:15 -04:00
/*
* Created by Brett Terpstra 6920201 on 17/10/22.
* Copyright (c) 2022 Brett Terpstra. All Rights Reserved.
*/
#ifndef STEP_2_BVH_H
#define STEP_2_BVH_H
#include "engine/util/std.h"
#include "engine/types.h"
2022-11-17 00:37:33 -05:00
#include "engine/util/models.h"
#include <config.h>
#ifdef COMPILE_GUI
#include <graphics/gl/gl.h>
#include <graphics/imgui/imgui.h>
#endif
2022-10-20 11:30:15 -04:00
#include <utility>
namespace Raytracing {
#ifdef COMPILE_GUI
extern std::shared_ptr<VAO> aabbVAO;
extern int count;
extern int selected;
#endif
struct BVHObject {
Object* ptr = nullptr;
AABB aabb;
};
struct BVHPartitionedSpace {
std::vector<BVHObject> left;
std::vector<BVHObject> right;
};
2022-11-16 17:34:17 -05:00
inline bool operator==(const BVHPartitionedSpace& left, const BVHPartitionedSpace& right) {
if (left.left.size() != right.left.size() || left.right.size() != right.right.size())
return false;
2022-11-17 00:37:33 -05:00
for (int i = 0; i < left.left.size(); i++) {
2022-11-16 17:34:17 -05:00
if (left.left[i].aabb != right.left[i].aabb)
return false;
}
2022-11-17 00:37:33 -05:00
for (int i = 0; i < left.right.size(); i++) {
2022-11-16 17:34:17 -05:00
if (left.right[i].aabb != right.right[i].aabb)
return false;
}
return true;
}
2022-10-20 11:30:15 -04:00
struct BVHNode {
public:
2022-11-15 16:23:37 -05:00
struct BVHHitData {
BVHNode* ptr{};
AABBHitData data{};
2022-11-15 16:23:37 -05:00
bool hit = false;
};
std::vector<BVHObject> objs;
2022-10-20 11:30:15 -04:00
AABB aabb;
BVHNode* left;
BVHNode* right;
BVHNode(std::vector<BVHObject> objs, AABB aabb, BVHNode* left, BVHNode* right): objs(std::move(objs)), aabb(std::move(aabb)),
2022-11-17 00:37:33 -05:00
left(left), right(right) {}
BVHHitData firstHitRayIntersectTraversal(const Ray& r, PRECISION_TYPE min, PRECISION_TYPE max);
2022-10-20 11:30:15 -04:00
~BVHNode() {
delete (left);
delete (right);
}
};
class BVHTree {
private:
BVHNode* root = nullptr;
static BVHPartitionedSpace partition(const std::pair<AABB, AABB>& aabbs, const std::vector<BVHObject>& objs);
2022-11-16 17:34:17 -05:00
BVHNode* addObjectsRecursively(const std::vector<BVHObject>& objects, const BVHPartitionedSpace& prevSpace);
2022-10-20 11:30:15 -04:00
public:
std::vector<Object*> noAABBObjects;
explicit BVHTree(const std::vector<Object*>& objectsInWorld) {
addObjects(objectsInWorld);
#ifdef COMPILE_GUI
auto aabbVertexData = Shapes::cubeVertexBuilder{};
if (aabbVAO == nullptr)
aabbVAO = std::make_shared<VAO>(aabbVertexData.cubeVerticesRaw, aabbVertexData.cubeUVs);
#endif
2022-10-20 11:30:15 -04:00
}
2022-11-16 16:15:08 -05:00
void addObjects(const std::vector<Object*>& objects);
2022-10-20 11:30:15 -04:00
std::vector<BVHObject> rayFirstHitIntersect(const Ray& ray, PRECISION_TYPE min, PRECISION_TYPE max);
std::vector<BVHObject> rayAnyHitIntersect(const Ray& ray, PRECISION_TYPE min, PRECISION_TYPE max);
2022-10-20 11:30:15 -04:00
~BVHTree() {
delete (root);
2022-10-20 11:30:15 -04:00
}
};
2022-11-17 00:37:33 -05:00
struct TriangleBVHObject {
Triangle* ptr = nullptr;
AABB aabb;
};
struct TriangleBVHPartitionedSpace {
std::vector<TriangleBVHObject> left;
std::vector<TriangleBVHObject> right;
};
struct TriangleBVHNode {
struct BVHHitData {
TriangleBVHNode* ptr{};
AABBHitData data{};
bool hit = false;
};
std::vector<TriangleBVHObject> objs;
AABB aabb;
TriangleBVHNode* left;
TriangleBVHNode* right;
TriangleBVHNode(std::vector<TriangleBVHObject> objs, AABB aabb, TriangleBVHNode* left, TriangleBVHNode* right)
: objs(std::move(objs)), aabb(std::move(aabb)), left(left), right(right) {}
~TriangleBVHNode() {
delete (left);
delete (right);
}
};
2022-10-20 11:30:15 -04:00
}
#endif //STEP_2_BVH_H