This repository was archived by the owner on Oct 26, 2026. It is now read-only.
Repository navigation
Expand file tree
/
Copy pathBHInternalNode.java
More file actions
209 lines (171 loc) · 5.62 KB
/
Copy pathBHInternalNode.java
File metadata and controls
209 lines (171 loc) · 5.62 KB
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
/*
* Copyright 1999-2008 Sun Microsystems, Inc. All Rights Reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Sun designates this
* particular file as subject to the "Classpath" exception as provided
* by Sun in the LICENSE file that accompanied this code.
*
* This code 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
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
* CA 95054 USA or visit www.sun.com if you need additional information or
* have any questions.
*
*/
package org.scijava.java3d;
class BHInternalNode extends BHNode {
static boolean debug2 = true;
BHNode rChild;
BHNode lChild;
BHInternalNode() {
super();
nodeType = BH_TYPE_INTERNAL;
this.rChild = null;
this.lChild = null;
}
BHInternalNode(BHNode parent) {
super(parent);
nodeType = BH_TYPE_INTERNAL;
this.rChild = null;
this.lChild = null;
}
BHInternalNode(BHNode parent, BHNode rChild, BHNode lChild) {
super(parent);
nodeType = BH_TYPE_INTERNAL;
this.rChild = rChild;
this.lChild = lChild;
}
BHInternalNode(BHNode parent, BoundingBox bHull) {
super(parent, bHull);
nodeType = BH_TYPE_INTERNAL;
this.rChild = null;
this.lChild = null;
}
BHInternalNode(BHNode parent, BHNode rChild, BHNode lChild, BoundingBox bHull) {
super(parent, bHull);
nodeType = BH_TYPE_INTERNAL;
this.rChild = rChild;
this.lChild = lChild;
}
BHNode getLeftChild() {
return (BHNode) lChild;
}
BHNode getRightChild() {
return (BHNode) rChild;
}
void setLeftChild(BHNode child) {
lChild = child;
}
void setRightChild(BHNode child) {
rChild = child;
}
void computeBoundingHull(BoundingBox bHull) {
computeBoundingHull();
bHull.set(this.bHull);
}
@Override
void computeBoundingHull() {
BoundingBox rChildBound = null;
BoundingBox lChildBound = null;
int i;
if((lChild==null) && (rChild==null)) {
bHull = null;
return;
}
if(lChild != null)
lChildBound = lChild.getBoundingHull();
if(rChild != null)
rChildBound = rChild.getBoundingHull();
if(bHull == null)
bHull = new BoundingBox();
// Since left child is null. bHull is equal to right child's Hull.
if(lChild == null) {
bHull.set(rChildBound);
return;
}
// Since right child is null. bHull is equal to left child's Hull.
if(rChild == null) {
bHull.set(lChildBound);
return;
}
// Compute the combined bounds of the children.
bHull.set(rChildBound);
bHull.combine(lChildBound);
}
@Override
void updateMarkedBoundingHull() {
if(mark == false)
return;
rChild.updateMarkedBoundingHull();
lChild.updateMarkedBoundingHull();
computeBoundingHull();
mark = false;
}
// this method inserts a single element into the tree given the stipulation
// that the current tree node already contains the child ... 3 cases
// one --node is inside the left child, and not inside the right
// so recurse placing it inside the left child
// two -- node is not inside the left but is inside the right
// recurse placing it inside the right child
// three -- node is not inside either one, added it to the current
// element
void insert( BHNode node, BHInsertStructure insertStructure ) {
// NOTE: the node must already be inside this node if its not then fail.
if(debug2)
if ( !this.isInside(node.bHull) ) {
System.err.println("Incorrect use of insertion, current node");
System.err.println("must contain the input element ...");
}
boolean insideRightChild = false;
boolean insideLeftChild = false;
// leaf children are considered inpenetrable for insert so returns false
if(this.rChild.nodeType == BHNode.BH_TYPE_LEAF) {
insideRightChild = false;
} else {
insideRightChild = this.rChild.isInside(node.bHull);
}
if(this.lChild.nodeType == BHNode.BH_TYPE_LEAF) {
insideLeftChild = false;
} else {
insideLeftChild = this.lChild.isInside(node.bHull);
}
if ( insideLeftChild && !insideRightChild ) {
((BHInternalNode)this.lChild).insert(node, insertStructure);
} else if ( !insideLeftChild && insideRightChild ) {
((BHInternalNode)this.rChild).insert(node, insertStructure);
} else if ( insideLeftChild && insideRightChild ) {
// choose randomly to put it in the left or right
if ( insertStructure.randomNumber.nextBoolean() ) {
((BHInternalNode)this.lChild).insert(node, insertStructure);
} else {
((BHInternalNode)this.rChild).insert(node, insertStructure);
}
} else {
// doesn't fit in either one ....
// lookup the current node this in the auxilaryInsertStructure
// if it appears then add element to the array of sub elements
// if not then allocate a new element to the array
insertStructure.lookupAndInsert(this, node);
}
}
@Override
void destroyTree(BHNode[] bhArr, int[] index) {
if(rChild != null)
rChild.destroyTree(bhArr, index);
if(lChild != null)
lChild.destroyTree(bhArr, index);
rChild = null;
lChild = null;
}
}