Searched defs:tree1 (Results 1 - 2 of 2) sorted by relevance
/external/eigen/unsupported/Eigen/src/BVH/ |
H A D | BVAlgorithms.h | 93 void BVIntersect(const BVH1 &tree1, const BVH2 &tree2, Intersector &intersector) //TODO: tandem descent when it makes sense argument 109 std::vector<std::pair<Index1, Index2> > todo(1, std::make_pair(tree1.getRootIndex(), tree2.getRootIndex())); 112 tree1.getChildren(todo.back().first, vBegin1, vEnd1, oBegin1, oEnd1); 117 const typename BVH1::Volume &vol1 = tree1.getVolume(*vBegin1); 125 if(internal::intersect_helper(tree1, helper, *vBegin1)) 235 typename Minimizer::Scalar BVMinimize(const BVH1 &tree1, const BVH2 &tree2, Minimizer &minimizer) argument 255 todo.push(std::make_pair(Scalar(), std::make_pair(tree1.getRootIndex(), tree2.getRootIndex()))); 258 tree1.getChildren(todo.top().second.first, vBegin1, vEnd1, oBegin1, oEnd1); 274 const typename BVH1::Volume &vol1 = tree1.getVolume(*vBegin1); 278 minimum = (std::min)(minimum, internal::minimize_helper(tree1, helpe [all...] |
/external/opencv/cv/src/ |
H A D | cvmatchcontours.cpp | 215 // tree1 - pointer to the first input contour tree object. 223 cvMatchContourTrees( const CvContourTree* tree1, const CvContourTree* tree2, argument 241 if( !tree1 || !tree2 ) 247 if( !CV_IS_SEQ_POLYGON_TREE( tree1 )) 253 lpt1 = tree1->total; 264 cvStartReadSeq( (CvSeq *) tree1, &reader1, 0 );
|
Completed in 199 milliseconds