src/Node.cpp

Go to the documentation of this file.

#include "Node.h"
#include "Primitive.h"


bool Node::leafIntersect(Ray & ray, float min, float max) const
{
    // here we store a copy of the ray
    Ray r = ray;
    bool found = false;

//    LOG(min << " " << max);
    // search for the nearest intersection
    for (unsigned int i=0; i < mPrimitives.size(); i++)
    {
        // if there is an intersection
        if (mPrimitives[i]->intersect(r))
        {
//        LOG(r << " .. " << r.hit() << " .. " << r.t());
            // do only proceed if the intersection is near than previous
            if (min - EPSILON <= r.t() && r.t() <= max + EPSILON)
            {
//        LOG(ray << " .. " << ray.hit() << " .. " << ray.t());
                ray = r;
                ray.setHit(mPrimitives[i], r.t());

                max = r.t();
                found = true;
            }
        }
    }
//    if (!found) LOG("FALSE");

    return found;
}

---