BVH.h

#ifndef BVH_h
#define BVH_h

#include "BBox.h"
#include <vector>
#include <functional>
#include <stdint.h>
#include "Object.h"
#include "IntersectionInfo.h"
#include "Ray.h"

//! Node descriptor for the flattened tree
namespace pelfrey {

struct BVHFlatNode {
  pelfrey::BBox bbox;
  uint32_t start, nPrims, rightOffset;
};

//! \author Brandon Pelfrey
//! A Bounding Volume Hierarchy system for fast Ray-Object intersection tests
class BVH {
  uint32_t nNodes, nLeafs, leafSize;
  std::vector<Object*> build_prims;

  //! Build the BVH tree out of build_prims
  void build();

  // Fast Traversal System
  BVHFlatNode *flatTree;

  public:
  BVH(const std::vector<Object*>& objects, uint32_t leafSize=4);

  bool getIntersection(const Ray& ray,
                       IntersectionInfo *intersection,
                       bool occlusion,
                       std::function<bool(const Object&, const Ray&, IntersectionInfo*)> cb_intersection={}) const;

  ~BVH();
};

}

#endif