◆ BallType
◆ BallTypeList
◆ BoxType
◆ VectorType
◆ VectorTypeList
◆ testIntersect1()
template<int Dim>
void TreeTest< Dim >::testIntersect1 |
( |
| ) |
|
|
inline |
140 for (
int i = 0;
i < 500; ++
i) {
141 b.push_back(
BallType(VectorType::Random(), 0.5 * internal::random(0., 1.)));
148 for (
int i = 0;
i < (
int)
b.size(); ++
i) i1.intersectObject(
b[
i]);
152 VERIFY(i1.count == i2.count);
int i
Definition: BiCGSTAB_step_by_step.cpp:9
Scalar * b
Definition: benchVecAdd.cpp:17
A simple bounding volume hierarchy based on AlignedBox.
Definition: KdBVH.h:68
#define VERIFY(a)
Definition: main.h:362
void BVIntersect(const BVH &tree, Intersector &intersector)
Definition: BVAlgorithms.h:79
Ball< Dim > BallType
Definition: BVH.cpp:134
std::vector< BallType, aligned_allocator< BallType > > BallTypeList
Definition: BVH.cpp:135
Definition: fft_test_shared.h:66
References b, Eigen::BVIntersect(), BallPointStuff< Dim >::count, i, int(), and VERIFY.
Referenced by EIGEN_DECLARE_TEST().
◆ testIntersect2()
template<int Dim>
void TreeTest< Dim >::testIntersect2 |
( |
| ) |
|
|
inline |
178 for (
int i = 0;
i < 50; ++
i) {
179 b.push_back(
BallType(VectorType::Random(), 0.5 * internal::random(0., 1.)));
180 for (
int j = 0;
j < 3; ++
j)
v.push_back(VectorType::Random());
188 for (
int i = 0;
i < (
int)
b.size(); ++
i)
Array< int, Dynamic, 1 > v
Definition: Array_initializer_list_vector_cxx11.cpp:1
int count
Definition: BVH.cpp:127
bool intersectObjectObject(const BallType &b1, const BallType &b2)
Definition: BVH.cpp:77
std::vector< VectorType, aligned_allocator< VectorType > > VectorTypeList
Definition: BVH.cpp:133
std::ptrdiff_t j
Definition: tut_arithmetic_redux_minmax.cpp:2
References b, Eigen::BVIntersect(), BallPointStuff< Dim >::count, i, int(), BallPointStuff< Dim >::intersectObjectObject(), j, v, and VERIFY.
Referenced by EIGEN_DECLARE_TEST().
◆ testMinimize1()
157 for (
int i = 0;
i < 500; ++
i) {
158 b.push_back(
BallType(VectorType::Random(), 0.01 * internal::random(0., 1.)));
#define min(a, b)
Definition: datatypes.h:22
#define max(a, b)
Definition: datatypes.h:23
#define VERIFY_IS_APPROX(a, b)
Definition: integer_types.cpp:13
Minimizer::Scalar BVMinimize(const BVH &tree, Minimizer &minimizer)
Definition: BVAlgorithms.h:217
References b, Eigen::BVMinimize(), i, int(), m1, m2(), max, min, and VERIFY_IS_APPROX.
Referenced by EIGEN_DECLARE_TEST().
◆ testMinimize2()
200 for (
int i = 0;
i < 50; ++
i) {
201 b.push_back(
BallType(VectorType::Random(), 1
e-7 + 1
e-6 * internal::random(0., 1.)));
202 for (
int j = 0;
j < 3; ++
j)
v.push_back(VectorType::Random());
212 for (
int i = 0;
i < (
int)
b.size(); ++
i)
Array< double, 1, 3 > e(1./3., 0.5, 2.)
double minimumOnObjectObject(const BallType &b1, const BallType &b2)
Definition: BVH.cpp:112
References b, Eigen::BVMinimize(), e(), i, int(), j, m1, m2(), max, min, BallPointStuff< Dim >::minimumOnObjectObject(), v, and VERIFY_IS_APPROX.
Referenced by EIGEN_DECLARE_TEST().
The documentation for this struct was generated from the following file: