Home
last modified time | relevance | path

Searched refs:vBegin1 (Results 1 – 1 of 1) sorted by relevance

/external/eigen/unsupported/Eigen/src/BVH/
DBVAlgorithms.h104 VolIter1 vBegin1 = VolIter1(), vEnd1 = VolIter1(); in BVIntersect() local
112 tree1.getChildren(todo.back().first, vBegin1, vEnd1, oBegin1, oEnd1); in BVIntersect()
116 for(; vBegin1 != vEnd1; ++vBegin1) { //go through child volumes of first tree in BVIntersect()
117 const typename BVH1::Volume &vol1 = tree1.getVolume(*vBegin1); in BVIntersect()
120 todo.push_back(std::make_pair(*vBegin1, *vCur2)); in BVIntersect()
125 if(internal::intersect_helper(tree1, helper, *vBegin1)) in BVIntersect()
248 VolIter1 vBegin1 = VolIter1(), vEnd1 = VolIter1(); in BVMinimize() local
258 tree1.getChildren(todo.top().second.first, vBegin1, vEnd1, oBegin1, oEnd1); in BVMinimize()
273 for(; vBegin1 != vEnd1; ++vBegin1) { //go through child volumes of first tree in BVMinimize()
274 const typename BVH1::Volume &vol1 = tree1.getVolume(*vBegin1); in BVMinimize()
[all …]