Searched refs:vCur2 (Results 1 – 1 of 1) sorted by relevance
| /external/eigen/unsupported/Eigen/src/BVH/ |
| D | BVAlgorithms.h | 106 VolIter2 vBegin2 = VolIter2(), vEnd2 = VolIter2(), vCur2 = VolIter2(); in BVIntersect() local
118 for(vCur2 = vBegin2; vCur2 != vEnd2; ++vCur2) { //go through child volumes of second tree in BVIntersect()
119 if(intersector.intersectVolumeVolume(vol1, tree2.getVolume(*vCur2))) in BVIntersect()
120 todo.push_back(std::make_pair(*vBegin1, *vCur2)); in BVIntersect()
131 for(vCur2 = vBegin2; vCur2 != vEnd2; ++vCur2) { //go through child volumes of second tree in BVIntersect()
133 if(internal::intersect_helper(tree2, helper, *vCur2)) in BVIntersect()
250 VolIter2 vBegin2 = VolIter2(), vEnd2 = VolIter2(), vCur2 = VolIter2(); in BVMinimize() local
267 for(vCur2 = vBegin2; vCur2 != vEnd2; ++vCur2) { //go through child volumes of second tree in BVMinimize()
269 minimum = (std::min)(minimum, internal::minimize_helper(tree2, helper, *vCur2, minimum)); in BVMinimize()
281 for(vCur2 = vBegin2; vCur2 != vEnd2; ++vCur2) { //go through child volumes of second tree in BVMinimize()
[all …]
|