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
|
#include <BH/Math.h>
#include <string.h>
#define EPSILON 0.00001f
#define PI 3.14159265358979323846f
void BH_Box3fUnion(const float aMin[3],
const float aMax[3],
const float bMin[3],
const float bMax[3],
float outMin[3],
float outMax[3])
{
BH_Vec3fMin(aMin, bMin, outMin);
BH_Vec3fMax(aMax, bMax, outMax);
}
int BH_Box3fIntersect(const float aMin[3],
const float aMax[3],
const float bMin[3],
const float bMax[3],
float outMin[3],
float outMax[3])
{
BH_Vec3fMax(aMin, bMin, outMin);
BH_Vec3fMin(aMax, bMax, outMax);
if (outMin[0] >= outMax[0] || outMin[1] >= outMax[1] || outMin[2] >= outMax[2])
return BH_ERROR;
return BH_OK;
}
int BH_Box3fContains(const float aMin[3],
const float aMax[3],
const float point[3])
{
if (point[0] < aMin[0] || point[1] < aMin[1] || point[2] < aMin[2])
return BH_ERROR;
if (point[0] > aMax[0] || point[1] > aMax[1] || point[2] > aMax[2])
return BH_ERROR;
return BH_OK;
}
int BH_Box3fEnclose(const float *points,
size_t size,
float outMin[3],
float outMax[3])
{
float tmp1[3], tmp2[3];
size_t i;
if (!size)
return BH_ERROR;
memcpy(tmp1, points, sizeof(tmp1));
memcpy(tmp2, points, sizeof(tmp2));
for (i = 1; i < size; i++)
{
BH_Vec3fMin(tmp1, points + i * 3, tmp1);
BH_Vec3fMax(tmp2, points + i * 3, tmp2);
}
memcpy(outMin, tmp1, sizeof(tmp1));
memcpy(outMax, tmp2, sizeof(tmp2));
return BH_OK;
}
|
