Repository navigation
Expand file tree
/
Copy pathtriangle_test.cc
More file actions
106 lines (77 loc) · 3.02 KB
/
Copy pathtriangle_test.cc
File metadata and controls
106 lines (77 loc) · 3.02 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
#include "triangle.h"
#include "gtest/gtest.h"
namespace {
TEST(Triangle, ConstructorWithoutNormals1) {
Triangle<FLOAT> t( {0.0, 0.0, 0.0}, {1.0, 0.0, 0.0}, {0.0, 1.0, 0.0});
ASSERT_TRUE( t.p1.equals_near({0.0, 0.0, 0.0}));
ASSERT_TRUE( t.p2.equals_near({1.0, 0.0, 0.0}));
ASSERT_TRUE( t.p3.equals_near({0.0, 1.0, 0.0}));
ASSERT_TRUE( t.n1.equals_near({0.0, 0.0, 1.0}) );
ASSERT_TRUE( t.n2.equals_near({0.0, 0.0, 1.0}) );
ASSERT_TRUE( t.n3.equals_near({0.0, 0.0, 1.0}) );
}
TEST(Triangle, ConstructorWithoutNormals2) {
Triangle<double> t( {-1.0, -1.0, 0.0}, {2.0, -1.0, 0.0}, {-1.0, 2.0, 0.0});
ASSERT_TRUE( t.p1.equals_near({-1.0, -1.0, 0.0}));
ASSERT_TRUE( t.p2.equals_near({2.0, -1.0, 0.0}));
ASSERT_TRUE( t.p3.equals_near( {-1.0, 2.0, 0.0}));
ASSERT_TRUE( t.n1.equals_near({0.0, 0.0, 1.0}) );
ASSERT_TRUE( t.n2.equals_near({0.0, 0.0, 1.0}) );
ASSERT_TRUE( t.n3.equals_near({0.0, 0.0, 1.0}) );
}
TEST(Triangle, ConstructorWithoutNormals3) {
Triangle<FLOAT> t( {0.0, 0.0, 0.0}, {0.0, 0.0, 1.0}, {0.0, 1.0, 0.0});
ASSERT_TRUE( t.p1.equals_near({0.0, 0.0, 0.0}));
ASSERT_TRUE( t.p2.equals_near({0.0, 0.0, 1.0}));
ASSERT_TRUE( t.p3.equals_near({0.0, 1.0, 0.0}));
ASSERT_TRUE( t.n1.equals_near({-1.0, 0.0, 0.0}) );
}
// TODO: tests for triangles with normals
// intersection is (0,0,0)
TEST(Triangle, Intersects1) {
Triangle<FLOAT> triangle( {0.0, 0.0, 0.0}, {0.0, 1.0, 0.0}, {1.0, 0.0, 0.0});
FLOAT t, u, v;
bool intersects = triangle.intersects( {0.0, 0.0, 1.0}, {0.0, 0.0, -1.0}, t, u, v);
ASSERT_TRUE(intersects);
ASSERT_FLOAT_EQ(1.0, t);
ASSERT_FLOAT_EQ(1.0, u);
ASSERT_FLOAT_EQ(0.0, v);
}
// same test as above, but point of triangle are ordered in reverse direction
TEST(Triangle, Intersects2) {
Triangle<FLOAT> triangle( {0.0, 0.0, 0.0}, {1.0, 0.0, 0.0}, {0.0, 1.0, 0.0} );
FLOAT t, u, v;
bool intersects = triangle.intersects( {0.0, 0.0, 1.0}, {0.0, 0.0, -1.0}, t, u, v);
ASSERT_TRUE(intersects);
ASSERT_FLOAT_EQ(1.0, t);
ASSERT_FLOAT_EQ(1.0, u);
ASSERT_FLOAT_EQ(0.0, v);
}
// intersection with plane is (2,2,0) outside triangle
TEST(Triangle, Intersects3) {
Triangle<FLOAT> triangle( {0.0, 0.0, 0.0}, {0.0, 1.0, 0.0}, {1.0, 0.0, 0.0});
FLOAT t, u, v;
bool intersects = triangle.intersects( {2.0, 2.0, 1.0}, {0.0, 0.0, -1.0}, t, u, v);
ASSERT_FALSE(intersects);
}
// intersection is (1.0, 1.0, 0.0)
TEST(Triangle, Intersects4) {
Triangle<FLOAT> triangle( {0.0, 0.0, 0.0}, {0.0, 2.0, 0.0}, {2.0, 0.0, 0.0});
FLOAT t, u, v;
bool intersects = triangle.intersects( {1.0, 1.0, 1.0}, {0.0, 0.0, -1.0}, t, u, v);
ASSERT_TRUE(intersects);
ASSERT_FLOAT_EQ(1.0, t);
ASSERT_FLOAT_EQ(0.0, u);
ASSERT_FLOAT_EQ(0.5, v);
}
// intersection is (0.5, 0.5, 0.0)
TEST(Triangle, Intersects5) {
Triangle<FLOAT> triangle( {0.0, 0.0, 0.0}, {0.0, 2.0, 0.0}, {2.0, 0.0, 0.0});
FLOAT t, u, v;
bool intersects = triangle.intersects( {0.5, 0.5, 10.0}, {0.0, 0.0, -1.0}, t, u, v);
ASSERT_TRUE(intersects);
ASSERT_FLOAT_EQ(10.0, t);
ASSERT_FLOAT_EQ(0.5, u);
ASSERT_FLOAT_EQ(0.25, v);
}
}