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
|
/**
* $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_TREE_H__
#define __SG_TREE_H__
#include "MT_Point3.h"
#include "SG_BBox.h"
#include <set>
class SG_Node;
/**
* SG_Tree.
* Holds a binary tree of SG_Nodes.
*/
class SG_Tree
{
SG_Tree* m_left;
SG_Tree* m_right;
SG_Tree* m_parent;
SG_BBox m_bbox;
MT_Point3 m_center;
MT_Scalar m_radius;
SG_Node* m_client_object;
public:
SG_Tree();
SG_Tree(SG_Tree* left, SG_Tree* right);
SG_Tree(SG_Node* client);
~SG_Tree();
/**
* Computes the volume of the bounding box.
*/
MT_Scalar volume() const;
/**
* Prints the tree (for debugging.)
*/
void dump() const;
/**
* Returns the left node.
*/
SG_Tree *Left() const;
SG_Tree *Right() const;
SG_Node *Client() const;
SG_Tree* Find(SG_Node *node);
/**
* Gets the eight corners of this treenode's bounding box,
* in world coordinates.
* @param box: an array of 8 MT_Point3
* @example MT_Point3 box[8];
* treenode->get(box);
*/
void get(MT_Point3 *box) const;
/**
* Get the tree node's bounding box.
*/
const SG_BBox& BBox() const;
/**
* Test if the given bounding box is inside this bounding box.
*/
bool inside(const MT_Point3 &point) const;
void SetLeft(SG_Tree *left);
void SetRight(SG_Tree *right);
MT_Point3 Center() const { return m_center; }
MT_Scalar Radius() { return m_radius; }
//friend class SG_TreeFactory;
struct greater
{
bool operator()(const SG_Tree *a, const SG_Tree *b)
{
return a->volume() > b->volume();
}
};
#ifdef WITH_CXX_GUARDEDALLOC
public:
void *operator new( unsigned int num_bytes) { return MEM_mallocN(num_bytes, "GE:SG_Tree"); }
void operator delete( void *mem ) { MEM_freeN(mem); }
#endif
};
/**
* SG_TreeFactory generates an SG_Tree from a list of SG_Nodes.
* It joins pairs of SG_Nodes to minimise the size of the resultant
* bounding box.
* cf building an optimised Huffman tree.
* @warning O(n^3)!!!
*/
class SG_TreeFactory
{
typedef std::multiset<SG_Tree*, SG_Tree::greater> TreeSet;
TreeSet m_objects;
public:
SG_TreeFactory();
~SG_TreeFactory();
/**
* Add a node to be added to the tree.
*/
void Add(SG_Node* client);
void Add(SG_Tree* tree);
/**
* Build the tree from the set of nodes added by
* the Add method.
*/
SG_Tree* MakeTreeUp();
/**
* Build the tree from the set of nodes top down.
*/
SG_Tree* MakeTreeDown(SG_BBox &bbox);
SG_Tree* MakeTree();
#ifdef WITH_CXX_GUARDEDALLOC
public:
void *operator new( unsigned int num_bytes) { return MEM_mallocN(num_bytes, "GE:SG_TreeFactory"); }
void operator delete( void *mem ) { MEM_freeN(mem); }
#endif
};
#endif /* __SG_BBOX_H__ */
|
