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
|
/**
* $Id$
*
* ***** BEGIN GPL 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.
*
* 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, 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 LICENSE BLOCK *****
* Bounding Box
*/
#ifndef __SG_BBOX_H__
#define __SG_BBOX_H__
#include "MT_Scalar.h"
#include "MT_Point3.h"
#include "MT_Vector3.h"
#include "MT_Transform.h"
#include <vector>
#ifdef WITH_CXX_GUARDEDALLOC
#include "MEM_guardedalloc.h"
#endif
class SG_Node;
/**
* Bounding box class.
* Holds the minimum and maximum axis aligned points of a node's bounding box,
* in world coordinates.
*/
class SG_BBox
{
MT_Point3 m_min;
MT_Point3 m_max;
public:
typedef enum { INSIDE, INTERSECT, OUTSIDE } intersect;
SG_BBox();
SG_BBox(const MT_Point3 &min, const MT_Point3 &max);
SG_BBox(const SG_BBox &other, const MT_Transform &world);
SG_BBox(const SG_BBox &other);
~SG_BBox();
/**
* Enlarges the bounding box to contain the specified point.
*/
SG_BBox& operator +=(const MT_Point3 &point);
/**
* Enlarges the bounding box to contain the specified bound box.
*/
SG_BBox& operator +=(const SG_BBox &bbox);
SG_BBox operator + (const SG_BBox &bbox2) const;
#if 0
/**
* Translates the bounding box.
*/
void translate(const MT_Vector3 &dx);
/**
* Scales the bounding box about the optional point.
*/
void scale(const MT_Vector3 &size, const MT_Point3 &point = MT_Point3(0., 0., 0.));
#endif
SG_BBox transform(const MT_Transform &world) const;
/**
* Computes the volume of the bounding box.
*/
MT_Scalar volume() const;
/**
* Test if the given point is inside this bounding box.
*/
bool inside(const MT_Point3 &point) const;
/**
* Test if the given bounding box is inside this bounding box.
*/
bool inside(const SG_BBox &other) const;
/**
* Test if the given bounding box is outside this bounding box.
*/
bool outside(const SG_BBox &other) const;
/**
* Test if the given bounding box intersects this bounding box.
*/
bool intersects(const SG_BBox &other) const;
/**
* Test the given bounding box with this bounding box.
*/
intersect test(const SG_BBox &other) const;
/**
* Get the eight points that define this bounding box.
*
* @param world a world transform to apply to the produced points bounding box.
*/
void get(MT_Point3 *box, const MT_Transform &world) const;
/**
* Get the eight points that define this axis aligned bounding box.
* This differs from SG_BBox::get() in that the produced box will be world axis aligned.
* The maximum & minimum local points will be transformed *before* splitting to 8 points.
* @param world a world transform to be applied.
*/
void getaa(MT_Point3 *box, const MT_Transform &world) const;
void getmm(MT_Point3 *box, const MT_Transform &world) const;
void split(SG_BBox &left, SG_BBox &right) const;
friend class SG_Tree;
#ifdef WITH_CXX_GUARDEDALLOC
public:
void *operator new( unsigned int num_bytes) { return MEM_mallocN(num_bytes, "GE:SG_BBox"); }
void operator delete( void *mem ) { MEM_freeN(mem); }
#endif
};
#endif /* __SG_BBOX_H__ */
|
