Go to the source code of this file.
Classes | |
| struct | Eigen::internal::intersector_helper1< Volume1, Object1, Object2, Intersector > |
| struct | Eigen::internal::intersector_helper2< Volume2, Object2, Object1, Intersector > |
| struct | Eigen::internal::minimizer_helper1< Volume1, Object1, Object2, Minimizer > |
| struct | Eigen::internal::minimizer_helper2< Volume2, Object2, Object1, Minimizer > |
Namespaces | |
| namespace | Eigen |
iterative scaling algorithm to equilibrate rows and column norms in matrices | |
| namespace | Eigen::internal |
Functions | |
| template<typename BVH , typename Intersector > | |
| void | Eigen::BVIntersect (const BVH &tree, Intersector &intersector) |
| template<typename BVH1 , typename BVH2 , typename Intersector > | |
| void | Eigen::BVIntersect (const BVH1 &tree1, const BVH2 &tree2, Intersector &intersector) |
| template<typename BVH , typename Minimizer > | |
| Minimizer::Scalar | Eigen::BVMinimize (const BVH &tree, Minimizer &minimizer) |
| template<typename BVH1 , typename BVH2 , typename Minimizer > | |
| Minimizer::Scalar | Eigen::BVMinimize (const BVH1 &tree1, const BVH2 &tree2, Minimizer &minimizer) |
| template<typename BVH , typename Intersector > | |
| bool | Eigen::internal::intersect_helper (const BVH &tree, Intersector &intersector, typename BVH::Index root) |
| template<typename BVH , typename Minimizer > | |
| Minimizer::Scalar | Eigen::internal::minimize_helper (const BVH &tree, Minimizer &minimizer, typename BVH::Index root, typename Minimizer::Scalar minimum) |