bvh.h

Go to the documentation of this file.

/*
 This file is part of the MinGfx Project.
 
 Copyright (c) 2017,2018 Regents of the University of Minnesota.
 All Rights Reserved.
 
 Original Author(s) of this File:
    David Schroeder, 2010-ish, University of Minnesota
    
 Author(s) of Significant Updates/Modifications to the File:
    Dan Keefe, 2018, University of Minnesota
    ...
 */
 
#ifndef SRC_BVH_H_
#define SRC_BVH_H_
 
#include "aabb.h"
#include "point3.h"
 
 
namespace mingfx {
    
// forward declarations
class Mesh;
class Ray;
    
 
class BVH {
public:
    BVH();
    
    virtual ~BVH();
 
    void CreateFromMesh(const Mesh &mesh);
    
    
    void CreateFromListOfBoxes(const std::vector<AABB> &boxes);
    
 
    std::vector<int> IntersectAndReturnUserData(const Ray &r) const;
 
    
private:
    
    // Simple internal data structure for storing each node of the BVH tree.
    class Node {
    public:
        Node() : child1(NULL), child2(NULL) {}
        
        // Links to children
        Node *child1;
        Node *child2;
        
        // Contains all geometry below this node.
        AABB box;
    };
    
    
    // for now, the copy constructor is private so no copies are allowed.
    // eventually, this would be good to implement and then it can be made public.
    BVH(const BVH &other);
 
    void BuildHierarchyRecursive(Node *node, std::vector<AABB> boxes);
    void IntersectRecursive(const Ray &r, Node *node, std::vector<int> *data_list) const;
    void FreeNodeRecursive(Node* node);
    
    Node* root_;
};
 
    
} // end namespace
 
#endif