Searched refs:BVMinimize (Results 1 – 4 of 4) sorted by relevance
| /external/eigen/unsupported/doc/examples/ |
| D | BVH_Example.cpp | 46 minDistSq = BVMinimize(redTree, blueTree, minimizer); //actual BVH minimization call in main()
|
| /external/eigen/unsupported/test/ |
| D | BVH.cpp | 136 m2 = BVMinimize(tree, i2); in testMinimize1()
188 m2 = BVMinimize(tree, vTree, i2); in testMinimize2()
|
| /external/eigen/unsupported/Eigen/src/BVH/ |
| D | BVAlgorithms.h | 219 typename Minimizer::Scalar BVMinimize(const BVH &tree, Minimizer &minimizer) in BVMinimize() function
235 typename Minimizer::Scalar BVMinimize(const BVH1 &tree1, const BVH2 &tree2, Minimizer &minimizer) in BVMinimize() function
|
| /external/eigen/unsupported/Eigen/ |
| D | BVH | 71 …* To use the hierarchy, call BVIntersect or BVMinimize, passing it a BVH (or two, for cartesian pr…
80 …* The cartesian product intersection and the BVMinimize queries are similar--see their individual …
|