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
|
struct BIH
{
struct node
{
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 tri
{
ushort vert[3];
};
struct tribb
{
svec center, radius;
bool outside(const ivec &bo, const ivec &br) const
{
return abs(bo.x - center.x) > br.x + radius.x ||
abs(bo.y - center.y) > br.y + radius.y ||
abs(bo.z - center.z) > br.z + radius.z;
}
};
enum { MESH_NOCLIP = 1<<0, MESH_ALPHA = 1<<1, MESH_CULLFACE = 1<<2 };
struct mesh
{
enum { MAXTRIS = 1<<14 };
matrix4x3 xform, invxform;
matrix3 xformnorm, invxformnorm;
float scale, invscale;
node *nodes;
int numnodes;
const tri *tris;
const tribb *tribbs;
int numtris;
const uchar *pos, *tc;
int posstride, tcstride;
Texture *tex;
int flags;
vec bbmin, bbmax;
mesh() : numnodes(0), numtris(0), tex(NULL), flags(0) {}
vec getpos(int i) const { return *(const vec *)(pos + i*posstride); }
vec2 gettc(int i) const { return *(const vec2 *)(tc + i*tcstride); }
};
mesh *meshes;
int nummeshes;
node *nodes;
int numnodes;
tribb *tribbs;
int numtris;
vec bbmin, bbmax, center;
float radius, entradius;
BIH(vector<mesh> &buildmeshes);
~BIH();
void build(mesh &m, ushort *indices, int numindices, const ivec &vmin, const ivec &vmax);
bool traverse(const vec &o, const vec &ray, float maxdist, float &dist, int mode);
bool traverse(const mesh &m, const vec &o, const vec &ray, const vec &invray, float maxdist, float &dist, int mode, node *curnode, float tmin, float tmax);
bool triintersect(const mesh &m, int tidx, const vec &mo, const vec &mray, float maxdist, float &dist, int mode);
void preload();
};
extern bool mmintersect(const extentity &e, const vec &o, const vec &ray, float maxdist, int mode, float &dist);
|
