1 | #include "IntersectableWrapper.h"
|
---|
2 | #include "Mesh.h"
|
---|
3 | #include "Triangle3.h"
|
---|
4 | #include "KdTree.h"
|
---|
5 | #include "BvHierarchy.h"
|
---|
6 |
|
---|
7 |
|
---|
8 | namespace GtpVisibilityPreprocessor {
|
---|
9 |
|
---|
10 |
|
---|
11 | AxisAlignedBox3 TriangleIntersectable::GetBox() const
|
---|
12 | {
|
---|
13 | return mItem.GetBoundingBox();
|
---|
14 | }
|
---|
15 |
|
---|
16 |
|
---|
17 | int TriangleIntersectable::CastRay(Ray &ray)
|
---|
18 | {
|
---|
19 | float nearestT = MAX_FLOAT;
|
---|
20 | float t;
|
---|
21 | Vector3 nearestNormal;
|
---|
22 |
|
---|
23 | if (ray.GetType() == Ray::LOCAL_RAY && !ray.intersections.empty())
|
---|
24 | nearestT = ray.intersections[0].mT;
|
---|
25 |
|
---|
26 | const int hitCode = mItem.CastRay(ray, t, nearestT, nearestNormal);
|
---|
27 |
|
---|
28 | nearestT = t;
|
---|
29 |
|
---|
30 | if (hitCode == Ray::INTERSECTION) {
|
---|
31 | if (ray.GetType() == Ray::LOCAL_RAY && !ray.intersections.empty()) {
|
---|
32 | ray.intersections[0] = Ray::Intersection(nearestT,
|
---|
33 | nearestNormal,
|
---|
34 | this,
|
---|
35 | 0);
|
---|
36 | }
|
---|
37 | else {
|
---|
38 | ray.intersections.push_back(Ray::Intersection(nearestT,
|
---|
39 | nearestNormal,
|
---|
40 | this,
|
---|
41 | 0));
|
---|
42 | }
|
---|
43 |
|
---|
44 | return 1;
|
---|
45 | }
|
---|
46 |
|
---|
47 | return 0;
|
---|
48 | }
|
---|
49 |
|
---|
50 |
|
---|
51 | int TriangleIntersectable::NumberOfFaces() const
|
---|
52 | {
|
---|
53 | return 1;
|
---|
54 | }
|
---|
55 |
|
---|
56 |
|
---|
57 | Vector3 TriangleIntersectable::GetNormal(const int idx) const
|
---|
58 | {
|
---|
59 | return mItem.GetNormal();
|
---|
60 | }
|
---|
61 |
|
---|
62 |
|
---|
63 | int
|
---|
64 | TriangleIntersectable::GetRandomSurfacePoint(Vector3 &point, Vector3 &normal)
|
---|
65 | {
|
---|
66 | // random barycentric coordinates
|
---|
67 | float a = RandomValue(0.0f, 1.0f);
|
---|
68 | float b = RandomValue(0.0f, 1.0f);
|
---|
69 | float c = RandomValue(0.0f, 1.0f);
|
---|
70 |
|
---|
71 | const float sum = a + b + c;
|
---|
72 |
|
---|
73 | // scale so we get vaccumated value of 1
|
---|
74 | if (sum)
|
---|
75 | {
|
---|
76 | a /= sum;
|
---|
77 | b /= sum;
|
---|
78 | c /= sum;
|
---|
79 | }
|
---|
80 |
|
---|
81 | //cout << "a: " << a << " b: " << b << " c: " << c << " sum: " << sum << endl;
|
---|
82 | point = mItem.mVertices[0] * a + mItem.mVertices[1] * b + mItem.mVertices[2] * c;
|
---|
83 | normal = mItem.GetNormal();
|
---|
84 |
|
---|
85 | return 0;
|
---|
86 | }
|
---|
87 |
|
---|
88 |
|
---|
89 | int
|
---|
90 | TriangleIntersectable::GetRandomSurfacePoint(const float u,
|
---|
91 | const float v,
|
---|
92 | Vector3 &point,
|
---|
93 | Vector3 &normal)
|
---|
94 | {
|
---|
95 | // random barycentric coordinates
|
---|
96 | float a = u;
|
---|
97 | float b = v;
|
---|
98 | float c = 1.0f - u - v;
|
---|
99 |
|
---|
100 | point = mItem.mVertices[0] * a + mItem.mVertices[1] * b + mItem.mVertices[2] * c;
|
---|
101 | normal = mItem.GetNormal();
|
---|
102 |
|
---|
103 | return 0;
|
---|
104 | }
|
---|
105 |
|
---|
106 |
|
---|
107 |
|
---|
108 | int TriangleIntersectable::GetRandomVisibleSurfacePoint(Vector3 &point,
|
---|
109 | Vector3 &normal,
|
---|
110 | const Vector3 &viewpoint,
|
---|
111 | const int maxTries)
|
---|
112 | {
|
---|
113 | return GetRandomSurfacePoint(point, normal);
|
---|
114 | }
|
---|
115 |
|
---|
116 |
|
---|
117 | int TriangleIntersectable::GetRandomEdgePoint(Vector3 &point, Vector3 &normal)
|
---|
118 | {
|
---|
119 | const int edge = Random(3);
|
---|
120 |
|
---|
121 | const Vector3 a = mItem.mVertices[edge];
|
---|
122 | const Vector3 b = mItem.mVertices[(edge + 1) % 3];
|
---|
123 |
|
---|
124 | const float factor = RandomValue(0.0f, 1.0f);
|
---|
125 |
|
---|
126 | point = a * factor + b * factor;
|
---|
127 | normal = mItem.GetNormal();
|
---|
128 |
|
---|
129 | return edge;
|
---|
130 | }
|
---|
131 |
|
---|
132 |
|
---|
133 | KdIntersectable::KdIntersectable(KdNode *item, const AxisAlignedBox3 &box) :
|
---|
134 | IntersectableWrapper<KdNode *>(item), mNumTriangles(-1)
|
---|
135 | {
|
---|
136 | }
|
---|
137 |
|
---|
138 |
|
---|
139 | int KdIntersectable::ComputeNumTriangles()
|
---|
140 | {
|
---|
141 | Intersectable::NewMail();
|
---|
142 |
|
---|
143 | std::stack<KdNode *> tStack;
|
---|
144 | tStack.push(mItem);
|
---|
145 |
|
---|
146 | if (mNumTriangles != -1)
|
---|
147 | return mNumTriangles;
|
---|
148 |
|
---|
149 | mNumTriangles = 0;
|
---|
150 |
|
---|
151 | while (!tStack.empty())
|
---|
152 | {
|
---|
153 | KdNode *node = tStack.top();
|
---|
154 | tStack.pop();
|
---|
155 |
|
---|
156 | if (!node->IsLeaf())
|
---|
157 | {
|
---|
158 | KdInterior *kdInterior = static_cast<KdInterior *>(node);
|
---|
159 |
|
---|
160 | tStack.push(kdInterior->mBack);
|
---|
161 | tStack.push(kdInterior->mFront);
|
---|
162 | }
|
---|
163 | else
|
---|
164 | {
|
---|
165 | KdLeaf *leaf = static_cast<KdLeaf *>(node);
|
---|
166 |
|
---|
167 | int tri = 0;
|
---|
168 |
|
---|
169 | for (size_t i = 0; i < leaf->mObjects.size(); ++ i)
|
---|
170 | {
|
---|
171 | TriangleIntersectable *obj =
|
---|
172 | static_cast<TriangleIntersectable *>(leaf->mObjects[i]);
|
---|
173 |
|
---|
174 | // check if already rendered
|
---|
175 | if (!obj->Mailed())
|
---|
176 | {
|
---|
177 | obj->Mail();
|
---|
178 | ++ tri;
|
---|
179 | }
|
---|
180 | }
|
---|
181 |
|
---|
182 | mNumTriangles += tri;
|
---|
183 | }
|
---|
184 | }
|
---|
185 |
|
---|
186 | return mNumTriangles;
|
---|
187 | }
|
---|
188 |
|
---|
189 | }
|
---|