Home
last modified time | relevance | path

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

/external/eigen/unsupported/Eigen/src/BVH/
DBVAlgorithms.h25 VolIter vBegin = VolIter(), vEnd = VolIter(); in intersect_helper() local
31 tree.getChildren(todo.back(), vBegin, vEnd, oBegin, oEnd); in intersect_helper()
34 for(; vBegin != vEnd; ++vBegin) //go through child volumes in intersect_helper()
35 if(intersector.intersectVolume(tree.getVolume(*vBegin))) in intersect_helper()
36 todo.push_back(*vBegin); in intersect_helper()
157 VolIter vBegin = VolIter(), vEnd = VolIter(); in minimize_helper() local
164 tree.getChildren(todo.top().second, vBegin, vEnd, oBegin, oEnd); in minimize_helper()
170 for(; vBegin != vEnd; ++vBegin) { //go through child volumes in minimize_helper()
171 Scalar val = minimizer.minimumOnVolume(tree.getVolume(*vBegin)); in minimize_helper()
173 todo.push(std::make_pair(val, *vBegin)); in minimize_helper()