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
|
/**
* $Id: SG_BBox.cpp,v 1.2 2004/05/21 09:21:15 kester Exp $
*
* ***** BEGIN GPL/BL DUAL LICENSE BLOCK *****
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version. The Blender
* Foundation also sells licenses for use in proprietary software under
* the Blender License. See http://www.blender.org/BL/ for information
* about this.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
* All rights reserved.
*
* The Original Code is: all of this file.
*
* Contributor(s): none yet.
*
* ***** END GPL/BL DUAL LICENSE BLOCK *****
* Bounding Box
*/
#include <math.h>
#include "SG_BBox.h"
#include "SG_Node.h"
SG_BBox::SG_BBox() :
m_min(MT_Point3(0., 0., 0.)),
m_max(MT_Point3(0., 0., 0.))
{
}
SG_BBox::SG_BBox(const MT_Point3 &min, const MT_Point3 &max) :
m_min(min),
m_max(max)
{
}
SG_BBox::SG_BBox(const SG_BBox &other, const MT_Transform &world) :
m_min(world(other.m_min)),
m_max(world(other.m_max))
{
*this += world(MT_Point3(m_min[0], m_min[1], m_max[2]));
*this += world(MT_Point3(m_min[0], m_max[1], m_min[2]));
*this += world(MT_Point3(m_min[0], m_max[1], m_max[2]));
*this += world(MT_Point3(m_max[0], m_min[1], m_min[2]));
*this += world(MT_Point3(m_max[0], m_min[1], m_max[2]));
*this += world(MT_Point3(m_max[0], m_max[1], m_min[2]));
}
SG_BBox::SG_BBox(const SG_BBox &other) :
m_min(other.m_min),
m_max(other.m_max)
{
}
SG_BBox::~ SG_BBox()
{
}
SG_BBox& SG_BBox::operator +=(const MT_Point3 &point)
{
if (point[0] < m_min[0])
m_min[0] = point[0];
else if (point[0] > m_max[0])
m_max[0] = point[0];
if (point[1] < m_min[1])
m_min[1] = point[1];
else if (point[1] > m_max[1])
m_max[1] = point[1];
if (point[2] < m_min[2])
m_min[2] = point[2];
else if (point[2] > m_max[2])
m_max[2] = point[2];
return *this;
}
SG_BBox& SG_BBox::operator += (const SG_BBox &bbox)
{
*this += bbox.m_min;
*this += bbox.m_max;
return *this;
}
SG_BBox SG_BBox::operator +(const SG_BBox &bbox2) const
{
SG_BBox ret = *this;
ret += bbox2;
return ret;
}
MT_Scalar SG_BBox::volume() const
{
MT_Vector3 size = m_max - m_min;
return size[0]*size[1]*size[2];
}
#if 0
void SG_BBox::translate(const MT_Vector3& dx)
{
m_min += dx;
m_max += dx;
}
void SG_BBox::scale(const MT_Vector3& size, const MT_Point3& point)
{
MT_Vector3 centre = (m_max - m_min)/2. + point;
m_max = (m_max - centre)*size;
m_min = (m_min - centre)*size;
}
#endif
SG_BBox SG_BBox::transform(const MT_Transform &world) const
{
SG_BBox bbox(world(m_min), world(m_max));
bbox += world(MT_Point3(m_min[0], m_min[1], m_max[2]));
bbox += world(MT_Point3(m_min[0], m_max[1], m_min[2]));
bbox += world(MT_Point3(m_min[0], m_max[1], m_max[2]));
bbox += world(MT_Point3(m_max[0], m_min[1], m_min[2]));
bbox += world(MT_Point3(m_max[0], m_min[1], m_max[2]));
bbox += world(MT_Point3(m_max[0], m_max[1], m_min[2]));
return bbox;
}
bool SG_BBox::inside(const MT_Point3 &point) const
{
return point[0] >= m_min[0] && point[0] <= m_max[0] &&
point[1] >= m_min[1] && point[1] <= m_max[1] &&
point[2] >= m_min[2] && point[2] <= m_max[2];
}
bool SG_BBox::inside(const SG_BBox& other) const
{
return inside(other.m_min) && inside(other.m_max);
}
bool SG_BBox::intersects(const SG_BBox& other) const
{
return inside(other.m_min) != inside(other.m_max);
}
bool SG_BBox::outside(const SG_BBox& other) const
{
return !inside(other.m_min) && !inside(other.m_max);
}
SG_BBox::intersect SG_BBox::test(const SG_BBox& other) const
{
bool point1(inside(other.m_min)), point2(inside(other.m_max));
return point1?(point2?INSIDE:INTERSECT):(point2?INTERSECT:OUTSIDE);
}
void SG_BBox::get(MT_Point3 *box, const MT_Transform &world) const
{
*box++ = world(m_min);
*box++ = world(MT_Point3(m_min[0], m_min[1], m_max[2]));
*box++ = world(MT_Point3(m_min[0], m_max[1], m_min[2]));
*box++ = world(MT_Point3(m_min[0], m_max[1], m_max[2]));
*box++ = world(MT_Point3(m_max[0], m_min[1], m_min[2]));
*box++ = world(MT_Point3(m_max[0], m_min[1], m_max[2]));
*box++ = world(MT_Point3(m_max[0], m_max[1], m_min[2]));
*box++ = world(m_max);
}
void SG_BBox::getaa(MT_Point3 *box, const MT_Transform &world) const
{
const MT_Point3 min(world(m_min)), max(world(m_max));
*box++ = min;
*box++ = MT_Point3(min[0], min[1], max[2]);
*box++ = MT_Point3(min[0], max[1], min[2]);
*box++ = MT_Point3(min[0], max[1], max[2]);
*box++ = MT_Point3(max[0], min[1], min[2]);
*box++ = MT_Point3(max[0], min[1], max[2]);
*box++ = MT_Point3(max[0], max[1], min[2]);
*box++ = max;
}
void SG_BBox::split(SG_BBox &left, SG_BBox &right) const
{
MT_Scalar sizex = m_max[0] - m_min[0];
MT_Scalar sizey = m_max[1] - m_min[1];
MT_Scalar sizez = m_max[2] - m_min[2];
if (sizex < sizey)
{
if (sizey > sizez)
{
left.m_min = m_min;
left.m_max[0] = m_max[0];
left.m_max[1] = m_min[1] + sizey/2.0;
left.m_max[2] = m_max[2];
right.m_min[0] = m_min[0];
right.m_min[1] = m_min[1] + sizey/2.0;
right.m_min[2] = m_min[2];
right.m_max = m_max;
std::cout << "splity" << std::endl;
} else {
left.m_min = m_min;
left.m_max[0] = m_max[0];
left.m_max[1] = m_max[1];
left.m_max[2] = m_min[2] + sizez/2.0;
right.m_min[0] = m_min[0];
right.m_min[1] = m_min[1];
right.m_min[2] = m_min[2] + sizez/2.0;
right.m_max = m_max;
std::cout << "splitz" << std::endl;
}
} else {
if (sizex > sizez)
{
left.m_min = m_min;
left.m_max[0] = m_min[0] + sizex/2.0;
left.m_max[1] = m_max[1];
left.m_max[2] = m_max[2];
right.m_min[0] = m_min[0] + sizex/2.0;
right.m_min[1] = m_min[1];
right.m_min[2] = m_min[2];
right.m_max = m_max;
std::cout << "splitx" << std::endl;
} else {
left.m_min = m_min;
left.m_max[0] = m_max[0];
left.m_max[1] = m_max[1];
left.m_max[2] = m_min[2] + sizez/2.0;
right.m_min[0] = m_min[0];
right.m_min[1] = m_min[1];
right.m_min[2] = m_min[2] + sizez/2.0;
right.m_max = m_max;
std::cout << "splitz" << std::endl;
}
}
//std::cout << "Left: " << left.m_min << " -> " << left.m_max << " Right: " << right.m_min << " -> " << right.m_max << std::endl;
}
|
