Arty
|
Bounding Volume Hierarchy. More...
#include <bvh.h>
Public Member Functions | |
void | build (const float3 *verts, const uint32_t *indices, size_t num_tris) |
Builds a BVH given a list of vertices and a list of indices. | |
void | traverse (const Ray &ray, Hit &hit, bool any=false) const |
Traverses the BVH in order to find the closest intersection, or any intersection if 'any' is set. | |
size_t | node_count () const |
Returns the number of nodes in the BVH. | |
Friends | |
struct | BvhBuilder |
Bounding Volume Hierarchy.