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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
|
// Copyright 2009-2021 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
#pragma once
#include "triangle.h"
#include "intersector_epilog.h"
/*! This intersector implements a modified version of the Moeller
* Trumbore intersector from the paper "Fast, Minimum Storage
* Ray-Triangle Intersection". In contrast to the paper we
* precalculate some factors and factor the calculations differently
* to allow precalculating the cross product e1 x e2. The resulting
* algorithm is similar to the fastest one of the paper "Optimizing
* Ray-Triangle Intersection via Automated Search". */
namespace embree
{
namespace isa
{
template<int M, typename UVMapper>
struct MoellerTrumboreHitM
{
__forceinline MoellerTrumboreHitM(const UVMapper& mapUV) : mapUV(mapUV) {}
__forceinline MoellerTrumboreHitM(const vbool<M>& valid, const vfloat<M>& U, const vfloat<M>& V, const vfloat<M>& T, const vfloat<M>& absDen, const Vec3vf<M>& Ng, const UVMapper& mapUV)
: U(U), V(V), T(T), absDen(absDen), mapUV(mapUV), valid(valid), vNg(Ng) {}
__forceinline void finalize()
{
const vfloat<M> rcpAbsDen = rcp(absDen);
vt = T * rcpAbsDen;
vu = U * rcpAbsDen;
vv = V * rcpAbsDen;
mapUV(vu,vv,vNg);
}
__forceinline Vec2vf<M> uv() const { return Vec2vf<M>(vu,vv); }
__forceinline vfloat<M> t () const { return vt; }
__forceinline Vec3vf<M> Ng() const { return vNg; }
__forceinline Vec2f uv (const size_t i) const { return Vec2f(vu[i],vv[i]); }
__forceinline float t (const size_t i) const { return vt[i]; }
__forceinline Vec3fa Ng(const size_t i) const { return Vec3fa(vNg.x[i],vNg.y[i],vNg.z[i]); }
public:
vfloat<M> U;
vfloat<M> V;
vfloat<M> T;
vfloat<M> absDen;
UVMapper mapUV;
public:
vbool<M> valid;
vfloat<M> vu;
vfloat<M> vv;
vfloat<M> vt;
Vec3vf<M> vNg;
};
template<int M, bool early_out = true>
struct MoellerTrumboreIntersector1
{
__forceinline MoellerTrumboreIntersector1() {}
__forceinline MoellerTrumboreIntersector1(const Ray& ray, const void* ptr) {}
template<typename UVMapper>
__forceinline bool intersect(const vbool<M>& valid0,
Ray& ray,
const Vec3vf<M>& tri_v0,
const Vec3vf<M>& tri_e1,
const Vec3vf<M>& tri_e2,
const Vec3vf<M>& tri_Ng,
const UVMapper& mapUV,
MoellerTrumboreHitM<M,UVMapper>& hit) const
{
/* calculate denominator */
vbool<M> valid = valid0;
const Vec3vf<M> O = Vec3vf<M>((Vec3fa)ray.org);
const Vec3vf<M> D = Vec3vf<M>((Vec3fa)ray.dir);
const Vec3vf<M> C = Vec3vf<M>(tri_v0) - O;
const Vec3vf<M> R = cross(C,D);
const vfloat<M> den = dot(Vec3vf<M>(tri_Ng),D);
const vfloat<M> absDen = abs(den);
const vfloat<M> sgnDen = signmsk(den);
/* perform edge tests */
const vfloat<M> U = dot(R,Vec3vf<M>(tri_e2)) ^ sgnDen;
const vfloat<M> V = dot(R,Vec3vf<M>(tri_e1)) ^ sgnDen;
/* perform backface culling */
#if defined(EMBREE_BACKFACE_CULLING)
valid &= (den < vfloat<M>(zero)) & (U >= 0.0f) & (V >= 0.0f) & (U+V<=absDen);
#else
valid &= (den != vfloat<M>(zero)) & (U >= 0.0f) & (V >= 0.0f) & (U+V<=absDen);
#endif
if (likely(early_out && none(valid))) return false;
/* perform depth test */
const vfloat<M> T = dot(Vec3vf<M>(tri_Ng),C) ^ sgnDen;
valid &= (absDen*vfloat<M>(ray.tnear()) < T) & (T <= absDen*vfloat<M>(ray.tfar));
if (likely(early_out && none(valid))) return false;
/* update hit information */
new (&hit) MoellerTrumboreHitM<M,UVMapper>(valid,U,V,T,absDen,tri_Ng,mapUV);
return true;
}
template<typename UVMapper>
__forceinline bool intersectEdge(const vbool<M>& valid,
Ray& ray,
const Vec3vf<M>& tri_v0,
const Vec3vf<M>& tri_e1,
const Vec3vf<M>& tri_e2,
const UVMapper& mapUV,
MoellerTrumboreHitM<M,UVMapper>& hit) const
{
const Vec3<vfloat<M>> tri_Ng = cross(tri_e2,tri_e1);
return intersect(valid,ray,tri_v0,tri_e1,tri_e2,tri_Ng,mapUV,hit);
}
template<typename UVMapper>
__forceinline bool intersectEdge(Ray& ray,
const Vec3vf<M>& tri_v0,
const Vec3vf<M>& tri_e1,
const Vec3vf<M>& tri_e2,
const UVMapper& mapUV,
MoellerTrumboreHitM<M,UVMapper>& hit) const
{
vbool<M> valid = true;
const Vec3<vfloat<M>> tri_Ng = cross(tri_e2,tri_e1);
return intersect(valid,ray,tri_v0,tri_e1,tri_e2,tri_Ng,mapUV,hit);
}
template<typename UVMapper>
__forceinline bool intersect(Ray& ray,
const Vec3vf<M>& v0,
const Vec3vf<M>& v1,
const Vec3vf<M>& v2,
const UVMapper& mapUV,
MoellerTrumboreHitM<M,UVMapper>& hit) const
{
const Vec3vf<M> e1 = v0-v1;
const Vec3vf<M> e2 = v2-v0;
return intersectEdge(ray,v0,e1,e2,mapUV,hit);
}
template<typename UVMapper>
__forceinline bool intersect(const vbool<M>& valid,
Ray& ray,
const Vec3vf<M>& v0,
const Vec3vf<M>& v1,
const Vec3vf<M>& v2,
const UVMapper& mapUV,
MoellerTrumboreHitM<M,UVMapper>& hit) const
{
const Vec3vf<M> e1 = v0-v1;
const Vec3vf<M> e2 = v2-v0;
return intersectEdge(valid,ray,v0,e1,e2,mapUV,hit);
}
template<typename UVMapper, typename Epilog>
__forceinline bool intersectEdge(Ray& ray,
const Vec3vf<M>& v0,
const Vec3vf<M>& e1,
const Vec3vf<M>& e2,
const UVMapper& mapUV,
const Epilog& epilog) const
{
MoellerTrumboreHitM<M,UVMapper> hit(mapUV);
if (likely(intersectEdge(ray,v0,e1,e2,mapUV,hit))) return epilog(hit.valid,hit);
return false;
}
template<typename UVMapper, typename Epilog>
__forceinline bool intersect(Ray& ray,
const Vec3vf<M>& v0,
const Vec3vf<M>& v1,
const Vec3vf<M>& v2,
const UVMapper& mapUV,
const Epilog& epilog) const
{
MoellerTrumboreHitM<M,UVMapper> hit(mapUV);
if (likely(intersect(ray,v0,v1,v2,mapUV,hit))) return epilog(hit.valid,hit);
return false;
}
template<typename Epilog>
__forceinline bool intersect(Ray& ray,
const Vec3vf<M>& v0,
const Vec3vf<M>& v1,
const Vec3vf<M>& v2,
const Epilog& epilog) const
{
auto mapUV = UVIdentity<M>();
MoellerTrumboreHitM<M,UVIdentity<M>> hit(mapUV);
if (likely(intersect(ray,v0,v1,v2,mapUV,hit))) return epilog(hit.valid,hit);
return false;
}
template<typename UVMapper, typename Epilog>
__forceinline bool intersect(const vbool<M>& valid,
Ray& ray,
const Vec3vf<M>& v0,
const Vec3vf<M>& v1,
const Vec3vf<M>& v2,
const UVMapper& mapUV,
const Epilog& epilog) const
{
MoellerTrumboreHitM<M,UVMapper> hit(mapUV);
if (likely(intersect(valid,ray,v0,v1,v2,mapUV,hit))) return epilog(hit.valid,hit);
return false;
}
};
template<int K, typename UVMapper>
struct MoellerTrumboreHitK
{
__forceinline MoellerTrumboreHitK(const UVMapper& mapUV) : mapUV(mapUV) {}
__forceinline MoellerTrumboreHitK(const vfloat<K>& U, const vfloat<K>& V, const vfloat<K>& T, const vfloat<K>& absDen, const Vec3vf<K>& Ng, const UVMapper& mapUV)
: U(U), V(V), T(T), absDen(absDen), Ng(Ng), mapUV(mapUV) {}
__forceinline std::tuple<vfloat<K>,vfloat<K>,vfloat<K>,Vec3vf<K>> operator() () const
{
const vfloat<K> rcpAbsDen = rcp(absDen);
const vfloat<K> t = T * rcpAbsDen;
vfloat<K> u = U * rcpAbsDen;
vfloat<K> v = V * rcpAbsDen;
Vec3vf<K> vNg = Ng;
mapUV(u,v,vNg);
return std::make_tuple(u,v,t,vNg);
}
vfloat<K> U;
vfloat<K> V;
const vfloat<K> T;
const vfloat<K> absDen;
const Vec3vf<K> Ng;
const UVMapper& mapUV;
};
template<int M, int K>
struct MoellerTrumboreIntersectorK
{
__forceinline MoellerTrumboreIntersectorK() {}
__forceinline MoellerTrumboreIntersectorK(const vbool<K>& valid, const RayK<K>& ray) {}
/*! Intersects K rays with one of M triangles. */
template<typename UVMapper>
__forceinline vbool<K> intersectK(const vbool<K>& valid0,
//RayK<K>& ray,
const Vec3vf<K>& ray_org,
const Vec3vf<K>& ray_dir,
const vfloat<K>& ray_tnear,
const vfloat<K>& ray_tfar,
const Vec3vf<K>& tri_v0,
const Vec3vf<K>& tri_e1,
const Vec3vf<K>& tri_e2,
const Vec3vf<K>& tri_Ng,
const UVMapper& mapUV,
MoellerTrumboreHitK<K,UVMapper> &hit) const
{
/* calculate denominator */
vbool<K> valid = valid0;
const Vec3vf<K> C = tri_v0 - ray_org;
const Vec3vf<K> R = cross(C,ray_dir);
const vfloat<K> den = dot(tri_Ng,ray_dir);
const vfloat<K> absDen = abs(den);
const vfloat<K> sgnDen = signmsk(den);
/* test against edge p2 p0 */
const vfloat<K> U = dot(tri_e2,R) ^ sgnDen;
valid &= U >= 0.0f;
if (likely(none(valid))) return false;
/* test against edge p0 p1 */
const vfloat<K> V = dot(tri_e1,R) ^ sgnDen;
valid &= V >= 0.0f;
if (likely(none(valid))) return false;
/* test against edge p1 p2 */
const vfloat<K> W = absDen-U-V;
valid &= W >= 0.0f;
if (likely(none(valid))) return false;
/* perform depth test */
const vfloat<K> T = dot(tri_Ng,C) ^ sgnDen;
valid &= (absDen*ray_tnear < T) & (T <= absDen*ray_tfar);
if (unlikely(none(valid))) return false;
/* perform backface culling */
#if defined(EMBREE_BACKFACE_CULLING)
valid &= den < vfloat<K>(zero);
if (unlikely(none(valid))) return false;
#else
valid &= den != vfloat<K>(zero);
if (unlikely(none(valid))) return false;
#endif
/* calculate hit information */
new (&hit) MoellerTrumboreHitK<K,UVMapper>(U,V,T,absDen,tri_Ng,mapUV);
return valid;
}
/*! Intersects K rays with one of M triangles. */
template<typename UVMapper>
__forceinline vbool<K> intersectK(const vbool<K>& valid0,
RayK<K>& ray,
const Vec3vf<K>& tri_v0,
const Vec3vf<K>& tri_v1,
const Vec3vf<K>& tri_v2,
const UVMapper& mapUV,
MoellerTrumboreHitK<K,UVMapper> &hit) const
{
const Vec3vf<K> e1 = tri_v0-tri_v1;
const Vec3vf<K> e2 = tri_v2-tri_v0;
const Vec3vf<K> Ng = cross(e2,e1);
return intersectK(valid0,ray.org,ray.dir,ray.tnear(),ray.tfar,tri_v0,e1,e2,Ng,mapUV,hit);
}
/*! Intersects K rays with one of M triangles. */
template<typename UVMapper, typename Epilog>
__forceinline vbool<K> intersectK(const vbool<K>& valid0,
RayK<K>& ray,
const Vec3vf<K>& tri_v0,
const Vec3vf<K>& tri_v1,
const Vec3vf<K>& tri_v2,
const UVMapper& mapUV,
const Epilog& epilog) const
{
MoellerTrumboreHitK<K,UVIdentity<K>> hit(mapUV);
const Vec3vf<K> e1 = tri_v0-tri_v1;
const Vec3vf<K> e2 = tri_v2-tri_v0;
const Vec3vf<K> Ng = cross(e2,e1);
const vbool<K> valid = intersectK(valid0,ray.org,ray.dir,ray.tnear(),ray.tfar,tri_v0,e1,e2,Ng,mapUV,hit);
return epilog(valid,hit);
}
template<typename Epilog>
__forceinline vbool<K> intersectK(const vbool<K>& valid0,
RayK<K>& ray,
const Vec3vf<K>& tri_v0,
const Vec3vf<K>& tri_v1,
const Vec3vf<K>& tri_v2,
const Epilog& epilog) const
{
UVIdentity<K> mapUV;
MoellerTrumboreHitK<K,UVIdentity<K>> hit(mapUV);
const Vec3vf<K> e1 = tri_v0-tri_v1;
const Vec3vf<K> e2 = tri_v2-tri_v0;
const Vec3vf<K> Ng = cross(e2,e1);
const vbool<K> valid = intersectK(valid0,ray.org,ray.dir,ray.tnear(),ray.tfar,tri_v0,e1,e2,Ng,mapUV,hit);
return epilog(valid,hit);
}
/*! Intersects K rays with one of M triangles. */
template<typename UVMapper, typename Epilog>
__forceinline vbool<K> intersectEdgeK(const vbool<K>& valid0,
RayK<K>& ray,
const Vec3vf<K>& tri_v0,
const Vec3vf<K>& tri_e1,
const Vec3vf<K>& tri_e2,
const UVMapper& mapUV,
const Epilog& epilog) const
{
MoellerTrumboreHitK<K,UVIdentity<K>> hit(mapUV);
const Vec3vf<K> tri_Ng = cross(tri_e2,tri_e1);
const vbool<K> valid = intersectK(valid0,ray.org,ray.dir,ray.tnear(),ray.tfar,tri_v0,tri_e1,tri_e2,tri_Ng,mapUV,hit);
return epilog(valid,hit);
}
/*! Intersect k'th ray from ray packet of size K with M triangles. */
template<typename UVMapper>
__forceinline bool intersectEdge(RayK<K>& ray,
size_t k,
const Vec3vf<M>& tri_v0,
const Vec3vf<M>& tri_e1,
const Vec3vf<M>& tri_e2,
const UVMapper& mapUV,
MoellerTrumboreHitM<M,UVMapper>& hit) const
{
/* calculate denominator */
typedef Vec3vf<M> Vec3vfM;
const Vec3vf<M> tri_Ng = cross(tri_e2,tri_e1);
const Vec3vfM O = broadcast<vfloat<M>>(ray.org,k);
const Vec3vfM D = broadcast<vfloat<M>>(ray.dir,k);
const Vec3vfM C = Vec3vfM(tri_v0) - O;
const Vec3vfM R = cross(C,D);
const vfloat<M> den = dot(Vec3vfM(tri_Ng),D);
const vfloat<M> absDen = abs(den);
const vfloat<M> sgnDen = signmsk(den);
/* perform edge tests */
const vfloat<M> U = dot(Vec3vf<M>(tri_e2),R) ^ sgnDen;
const vfloat<M> V = dot(Vec3vf<M>(tri_e1),R) ^ sgnDen;
/* perform backface culling */
#if defined(EMBREE_BACKFACE_CULLING)
vbool<M> valid = (den < vfloat<M>(zero)) & (U >= 0.0f) & (V >= 0.0f) & (U+V<=absDen);
#else
vbool<M> valid = (den != vfloat<M>(zero)) & (U >= 0.0f) & (V >= 0.0f) & (U+V<=absDen);
#endif
if (likely(none(valid))) return false;
/* perform depth test */
const vfloat<M> T = dot(Vec3vf<M>(tri_Ng),C) ^ sgnDen;
valid &= (absDen*vfloat<M>(ray.tnear()[k]) < T) & (T <= absDen*vfloat<M>(ray.tfar[k]));
if (likely(none(valid))) return false;
/* calculate hit information */
new (&hit) MoellerTrumboreHitM<M,UVMapper>(valid,U,V,T,absDen,tri_Ng,mapUV);
return true;
}
template<typename UVMapper>
__forceinline bool intersectEdge(RayK<K>& ray,
size_t k,
const BBox<vfloat<M>>& time_range,
const Vec3vf<M>& tri_v0,
const Vec3vf<M>& tri_e1,
const Vec3vf<M>& tri_e2,
const UVMapper& mapUV,
MoellerTrumboreHitM<M,UVMapper>& hit) const
{
if (likely(intersect(ray,k,tri_v0,tri_e1,tri_e2,mapUV,hit)))
{
hit.valid &= time_range.lower <= vfloat<M>(ray.time[k]);
hit.valid &= vfloat<M>(ray.time[k]) < time_range.upper;
return any(hit.valid);
}
return false;
}
template<typename UVMapper>
__forceinline bool intersect(RayK<K>& ray,
size_t k,
const Vec3vf<M>& v0,
const Vec3vf<M>& v1,
const Vec3vf<M>& v2,
const UVMapper& mapUV,
MoellerTrumboreHitM<M,UVMapper>& hit) const
{
const Vec3vf<M> e1 = v0-v1;
const Vec3vf<M> e2 = v2-v0;
return intersectEdge(ray,k,v0,e1,e2,mapUV,hit);
}
template<typename UVMapper, typename Epilog>
__forceinline bool intersectEdge(RayK<K>& ray,
size_t k,
const Vec3vf<M>& tri_v0,
const Vec3vf<M>& tri_e1,
const Vec3vf<M>& tri_e2,
const UVMapper& mapUV,
const Epilog& epilog) const
{
MoellerTrumboreHitM<M,UVMapper> hit(mapUV);
if (likely(intersectEdge(ray,k,tri_v0,tri_e1,tri_e2,mapUV,hit))) return epilog(hit.valid,hit);
return false;
}
template<typename UVMapper, typename Epilog>
__forceinline bool intersectEdge(RayK<K>& ray,
size_t k,
const BBox<vfloat<M>>& time_range,
const Vec3vf<M>& tri_v0,
const Vec3vf<M>& tri_e1,
const Vec3vf<M>& tri_e2,
const UVMapper& mapUV,
const Epilog& epilog) const
{
MoellerTrumboreHitM<M,UVMapper> hit(mapUV);
if (likely(intersectEdge(ray,k,time_range,tri_v0,tri_e1,tri_e2,mapUV,hit))) return epilog(hit.valid,hit);
return false;
}
template<typename UVMapper, typename Epilog>
__forceinline bool intersect(RayK<K>& ray,
size_t k,
const Vec3vf<M>& v0,
const Vec3vf<M>& v1,
const Vec3vf<M>& v2,
const UVMapper& mapUV,
const Epilog& epilog) const
{
const Vec3vf<M> e1 = v0-v1;
const Vec3vf<M> e2 = v2-v0;
return intersectEdge(ray,k,v0,e1,e2,mapUV,epilog);
}
template<typename Epilog>
__forceinline bool intersect(RayK<K>& ray,
size_t k,
const Vec3vf<M>& v0,
const Vec3vf<M>& v1,
const Vec3vf<M>& v2,
const Epilog& epilog) const
{
return intersect(ray,k,v0,v1,v2,UVIdentity<M>(),epilog);
}
template<typename UVMapper, typename Epilog>
__forceinline bool intersect(RayK<K>& ray,
size_t k,
const BBox<vfloat<M>>& time_range,
const Vec3vf<M>& v0,
const Vec3vf<M>& v1,
const Vec3vf<M>& v2,
const UVMapper& mapUV,
const Epilog& epilog) const
{
const Vec3vf<M> e1 = v0-v1;
const Vec3vf<M> e2 = v2-v0;
return intersectEdge(ray,k,time_range,v0,e1,e2,mapUV,epilog);
}
};
}
}
|