21 for (
unsigned int i = 0; i <
shapes->size(); i++)
25 if (
shapes->at(i)->getIntersection(*r, currentI) && currentI.
t > 0.0001)
27 result.push_back(currentI);
decimal(* pLeafTreatmentFunction)(std::list< Intersection > &, decimal)
Pointer to the treatment function of leaf.
std::vector< Shape * > * shapes
Vector of pointers to shapes.
virtual decimal traverse(Ray *r, std::list< Intersection > &result) const
Run this accelerator.
: Describes a ray by a pair of unsigned int. The first one gives the source number (in the range 0-40...