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
|
struct BIHNode
{
short split[2];
ushort child[2];
int axis() const { return child[0]>>14; }
int childindex(int which) const { return child[which]&0x3FFF; }
bool isleaf(int which) const { return (child[1]&(1<<(14+which)))!=0; }
};
struct BIH
{
struct tri : triangle
{
float tc[6];
Texture *tex;
};
int maxdepth;
int numnodes;
BIHNode *nodes;
int numtris;
tri *tris, *noclip;
vec bbmin, bbmax;
float radius;
BIH(vector<tri> *t);
~BIH()
{
DELETEA(nodes);
DELETEA(tris);
}
static bool triintersect(tri &t, const vec &o, const vec &ray, float maxdist, float &dist, int mode, tri *noclip);
void build(vector<BIHNode> &buildnodes, ushort *indices, int numindices, const vec &vmin, const vec &vmax, int depth = 1);
bool traverse(const vec &o, const vec &ray, float maxdist, float &dist, int mode);
bool traverse(const vec &o, const vec &ray, const vec &invray, float maxdist, float &dist, int mode, BIHNode *curnode, float tmin, float tmax);
void preload();
};
extern bool mmintersect(const extentity &e, const vec &o, const vec &ray, float maxdist, int mode, float &dist);
|
