| BVAlgorithms.h | 18 template<typename BVH, typename Intersector>
19 bool intersect_helper(const BVH &tree, Intersector &intersector, typename BVH::Index root)
35 if(intersector.intersectVolume(tree.getVolume(*vBegin)))
39 if(intersector.intersectObject(*oBegin))
40 return true; //intersector said to stop query
46 template<typename Volume1, typename Object1, typename Object2, typename Intersector>
49 intersector_helper1(const Object2 &inStored, Intersector &in) : stored(inStored), intersector(in) {}
50 bool intersectVolume(const Volume1 &vol) { return intersector.intersectVolumeObject(vol, stored);
53 Intersector &intersector; member in struct:Eigen::internal::intersector_helper1
65 Intersector &intersector; member in struct:Eigen::internal::intersector_helper2
[all...] |
