This repository was archived by the owner on Oct 26, 2026. It is now read-only.
Repository navigation
Expand file tree
/
Copy pathBHTree.java
More file actions
1154 lines (970 loc) · 32.2 KB
/
Copy pathBHTree.java
File metadata and controls
1154 lines (970 loc) · 32.2 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
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
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* 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;
import java.util.ArrayList;
import java.util.Vector;
import org.scijava.vecmath.Point4d;
class BHTree {
Locale locale;
private BHNode root;
private BHInsertStructure insertStructure = null;
// Temporary point, so we dont generate garbage
Point4d tPoint4d = new Point4d();
// A flag to signal that number of renderAtoms sent to RenderBin is stable.
private boolean stable = false;
// An estimate of the maxmium depth of this tree (upper bound).
int estMaxDepth;
static final double LOG_OF_2 = Math.log(2);
// Assume that the size avg. leaf node is 256 bytes. For a 64bit system, we'll
// down with max depth of 56 for an ideal balance tree.
static final int DEPTH_UPPER_BOUND = 56;
static final int INCR_DEPTH_BOUND = 5;
int depthUpperBound = DEPTH_UPPER_BOUND;
BHTree() {
locale = null;
root = null;
}
BHTree(Locale loc) {
locale = loc;
root = null;
}
BHTree(BHNode bhArr[]) {
locale = null;
root = null;
create(bhArr);
}
void setLocale(Locale loc) {
locale = loc;
}
Locale getLocale() {
return locale;
}
void cluster(BHInternalNode root, BHNode[] bhArr) {
if(J3dDebug.devPhase) {
if(J3dDebug.doDebug(J3dDebug.bHTree, J3dDebug.LEVEL_4,
"BHTree.java :In cluster length is " + bhArr.length
+ "\n")) {
for(int i=0; i<bhArr.length; i++) {
System.err.println(bhArr[i]);
}
}
}
if((bhArr == null) || (bhArr.length < 2) || (root == null)){
if(J3dDebug.devPhase)
J3dDebug.doDebug(J3dDebug.bHTree, J3dDebug.LEVEL_1,
"BHTree.java : cluster : trouble! \n");
return;
}
int centerValuesIndex[] = new int[bhArr.length];
float centerValues[][] = computeCenterValues(bhArr, centerValuesIndex);
constructTree(root, bhArr, centerValues, centerValuesIndex);
}
// bhArr can only contains BHLeafNode.
void boundsChanged(BHNode bhArr[], int size) {
// Mark phase.
markParentChain(bhArr, size);
// Compute phase.
root.updateMarkedBoundingHull();
}
// Return true if bhTree's root in encompass by frustumBBox and nothing changed.
boolean getVisibleBHTrees(RenderBin rBin, ArrayList bhTrees,
BoundingBox frustumBBox, long referenceTime,
boolean stateChanged, int visibilityPolicy,
boolean singleLocale) {
int i, j, size;
if ((frustumBBox != null) && (root != null)) {
boolean inSide = aEncompassB(frustumBBox, root.bHull);
/*
System.err.println("stateChanged is " + stateChanged);
System.err.println("frustumBBox is " + frustumBBox);
System.err.println("root.bHull is " + root.bHull);
System.err.println("inSide is " + inSide);
*/
if(singleLocale && !stateChanged && inSide && stable) {
// just return the whole tree, no change in render mol..
// System.err.println("Optimize case 1 ..." + this);
bhTrees.add(root);
return true;
}
else if(!stateChanged && inSide) {
// the whole tree is in, but we've to be sure that RenderBin is
// stable ...
// System.err.println("Optimize case 2 ..." + this);
select(rBin, bhTrees, frustumBBox, root, referenceTime,
visibilityPolicy, true);
bhTrees.add(root);
stable = true;
} else {
// System.err.println("Not in Optimize case ..." + this);
select(rBin, bhTrees, frustumBBox, root, referenceTime,
visibilityPolicy, false);
stable = false;
}
}
return false;
}
private void select(RenderBin rBin, ArrayList bhTrees, BoundingBox frustumBBox,
BHNode bh, long referenceTime, int visibilityPolicy,
boolean inSide) {
if ((bh == null) || (bh.bHull.isEmpty())) {
return;
}
switch(bh.nodeType) {
case BHNode.BH_TYPE_LEAF:
if((((BHLeafNode) bh).leafIF instanceof GeometryAtom) &&
(((BHLeafNode) bh).isEnable(visibilityPolicy)) &&
((inSide) || (frustumBBox.intersect(bh.bHull)))) {
// do render atom setup.
rBin.processGeometryAtom((GeometryAtom)
(((BHLeafNode)bh).leafIF),
referenceTime);
if(!inSide) {
bhTrees.add(bh);
}
}
break;
case BHNode.BH_TYPE_INTERNAL:
if(inSide) {
select(rBin, bhTrees, frustumBBox,
((BHInternalNode)bh).getRightChild(),
referenceTime, visibilityPolicy, true);
select(rBin, bhTrees, frustumBBox,
((BHInternalNode)bh).getLeftChild(),
referenceTime, visibilityPolicy, true);
}
else if(aEncompassB(frustumBBox, bh.bHull)) {
bhTrees.add(bh);
select(rBin, bhTrees, frustumBBox,
((BHInternalNode)bh).getRightChild(),
referenceTime, visibilityPolicy, true);
select(rBin, bhTrees, frustumBBox,
((BHInternalNode)bh).getLeftChild(),
referenceTime, visibilityPolicy, true);
}
else if(frustumBBox.intersect(bh.bHull)) {
select(rBin, bhTrees, frustumBBox,
((BHInternalNode)bh).getRightChild(),
referenceTime, visibilityPolicy, false);
select(rBin, bhTrees, frustumBBox,
((BHInternalNode)bh).getLeftChild(),
referenceTime, visibilityPolicy, false);
}
break;
}
}
// returns true iff the bBox is completely inside aBox
// i.e. bBoxl values are strictly less than or equal to all aBox values.
static boolean aEncompassB(BoundingBox aBox, BoundingBox bBox) {
return ((aBox.upper.x >= bBox.upper.x) &&
(aBox.upper.y >= bBox.upper.y) &&
(aBox.upper.z >= bBox.upper.z) &&
(aBox.lower.x <= bBox.lower.x) &&
(aBox.lower.y <= bBox.lower.y) &&
(aBox.lower.z <= bBox.lower.z));
}
BHLeafInterface selectAny(GeometryAtom atom, int accurancyMode) {
if (atom.source.geometryList == null)
return null;
BHNode bhNode = doSelectAny(atom, root, accurancyMode);
if (bhNode == null) {
return null;
}
return ((BHLeafNode) bhNode).leafIF;
}
BHLeafInterface selectAny(GeometryAtom atoms[], int size, int accurancyMode) {
BHNode bhNode = doSelectAny(atoms, size, root, accurancyMode);
if (bhNode == null) {
return null;
}
return ((BHLeafNode) bhNode).leafIF;
}
private BHNode doSelectAny(GeometryAtom atoms[],int atomSize,
BHNode bh, int accurancyMode) {
if ((bh == null) || (bh.bHull.isEmpty())) {
return null;
}
switch (bh.nodeType) {
case BHNode.BH_TYPE_LEAF:
BHLeafInterface leaf = ((BHLeafNode) bh).leafIF;
GeometryAtom atom;
int i;
if (leaf instanceof GeometryAtom) {
GeometryAtom leafAtom = (GeometryAtom) leaf;
if (((BHLeafNode) bh).isEnable() &&
leafAtom.source.isCollidable) {
// atom self intersection between atoms[]
for (i=atomSize-1; i >=0; i--) {
if (atoms[i] == leafAtom) {
return null;
}
}
for (i=atomSize-1; i >=0; i--) {
atom = atoms[i];
if ((atom.source.sourceNode != leafAtom.source.sourceNode) &&
(atom.source.collisionVwcBound.intersect(leafAtom.source.collisionVwcBound)) &&
((accurancyMode == WakeupOnCollisionEntry.USE_BOUNDS) ||
((leafAtom.source.geometryList != null) &&
(atom.source.intersectGeometryList(leafAtom.source))))) {
return bh;
}
}
}
} else if (leaf instanceof GroupRetained) {
if (((BHLeafNode) bh).isEnable() &&
((GroupRetained) leaf).sourceNode.collidable) {
for (i=atomSize-1; i >=0; i--) {
atom = atoms[i];
if (atom.source.collisionVwcBound.intersect(bh.bHull) &&
((accurancyMode == WakeupOnCollisionEntry.USE_BOUNDS) ||
(atom.source.intersectGeometryList(
atom.source.getCurrentLocalToVworld(0), bh.bHull)))) {
return bh;
}
}
}
}
return null;
case BHNode.BH_TYPE_INTERNAL:
for (i=atomSize-1; i >=0; i--) {
atom = atoms[i];
if (atom.source.collisionVwcBound.intersect(bh.bHull))
{
BHNode hitNode = doSelectAny(atoms,
atomSize,
((BHInternalNode) bh).getRightChild(),
accurancyMode);
if (hitNode != null)
return hitNode;
return doSelectAny(atoms, atomSize,
((BHInternalNode) bh).getLeftChild(),
accurancyMode);
}
}
return null;
}
return null;
}
private BHNode doSelectAny(GeometryAtom atom, BHNode bh, int accurancyMode) {
if ((bh == null) || (bh.bHull.isEmpty())) {
return null;
}
switch (bh.nodeType) {
case BHNode.BH_TYPE_LEAF:
BHLeafInterface leaf = ((BHLeafNode) bh).leafIF;
if (leaf instanceof GeometryAtom) {
GeometryAtom leafAtom = (GeometryAtom) leaf;
if ((atom.source.sourceNode != leafAtom.source.sourceNode) &&
(((BHLeafNode) bh).isEnable()) &&
(leafAtom.source.isCollidable) &&
(atom.source.collisionVwcBound.intersect(leafAtom.source.collisionVwcBound)) &&
((accurancyMode == WakeupOnCollisionEntry.USE_BOUNDS) ||
((leafAtom.source.geometryList != null) &&
(atom.source.intersectGeometryList(leafAtom.source))))) {
return bh;
}
} else if (leaf instanceof GroupRetained) {
if (((BHLeafNode) bh).isEnable() &&
((GroupRetained) leaf).sourceNode.collidable &&
atom.source.collisionVwcBound.intersect(bh.bHull) &&
((accurancyMode == WakeupOnCollisionEntry.USE_BOUNDS) ||
(atom.source.intersectGeometryList(
atom.source.getCurrentLocalToVworld(0), bh.bHull)))) {
return bh;
}
}
return null;
case BHNode.BH_TYPE_INTERNAL:
if (atom.source.collisionVwcBound.intersect(bh.bHull)) {
BHNode hitNode = doSelectAny(atom,
((BHInternalNode) bh).getRightChild(),
accurancyMode);
if (hitNode != null)
return hitNode;
return doSelectAny(atom,
((BHInternalNode) bh).getLeftChild(),
accurancyMode);
}
return null;
}
return null;
}
BHLeafInterface selectAny(Bounds bound, int accurancyMode,
NodeRetained armingNode) {
if (bound == null) {
return null;
}
BHNode bhNode = doSelectAny(bound, root, accurancyMode, armingNode);
if (bhNode == null) {
return null;
}
return ((BHLeafNode) bhNode).leafIF;
}
private BHNode doSelectAny(Bounds bound, BHNode bh, int accurancyMode,
NodeRetained armingNode) {
if ((bh == null) || (bh.bHull.isEmpty())) {
return null;
}
switch (bh.nodeType) {
case BHNode.BH_TYPE_LEAF:
BHLeafInterface leaf = ((BHLeafNode) bh).leafIF;
if (leaf instanceof GeometryAtom) {
GeometryAtom leafAtom = (GeometryAtom) leaf;
if ((((BHLeafNode) bh).isEnable()) &&
(leafAtom.source.isCollidable) &&
(bound.intersect(leafAtom.source.collisionVwcBound)) &&
((accurancyMode == WakeupOnCollisionEntry.USE_BOUNDS) ||
((leafAtom.source.geometryList != null) &&
(leafAtom.source.intersectGeometryList(
leafAtom.source.getCurrentLocalToVworld(0), bound))))) {
return bh;
}
} else if (leaf instanceof GroupRetained) {
if ((leaf != armingNode) &&
((BHLeafNode) bh).isEnable() &&
((GroupRetained) leaf).sourceNode.collidable &&
bound.intersect(bh.bHull)) {
return bh;
}
}
return null;
case BHNode.BH_TYPE_INTERNAL:
if (bound.intersect(bh.bHull)) {
BHNode hitNode = doSelectAny(bound,
((BHInternalNode) bh).getRightChild(),
accurancyMode,
armingNode);
if (hitNode != null)
return hitNode;
return doSelectAny(bound,
((BHInternalNode) bh).getLeftChild(),
accurancyMode,
armingNode);
}
return null;
}
return null;
}
BHLeafInterface selectAny(Bounds bound, int accurancyMode,
GroupRetained armingGroup) {
if (bound == null) {
return null;
}
BHNode bhNode = doSelectAny(bound, root, accurancyMode, armingGroup);
if (bhNode == null) {
return null;
}
return ((BHLeafNode) bhNode).leafIF;
}
private BHNode doSelectAny(Bounds bound, BHNode bh, int accurancyMode,
GroupRetained armingGroup) {
if ((bh == null) || (bh.bHull.isEmpty())) {
return null;
}
switch (bh.nodeType) {
case BHNode.BH_TYPE_LEAF:
BHLeafInterface leaf = ((BHLeafNode) bh).leafIF;
if (leaf instanceof GeometryAtom) {
GeometryAtom leafAtom = (GeometryAtom) leaf;
if ((((BHLeafNode) bh).isEnable()) &&
(leafAtom.source.isCollidable) &&
(bound.intersect(leafAtom.source.collisionVwcBound)) &&
(!isDescendent(leafAtom.source.sourceNode,
armingGroup, leafAtom.source.key)) &&
((accurancyMode == WakeupOnCollisionEntry.USE_BOUNDS) ||
((leafAtom.source.geometryList != null) &&
(leafAtom.source.intersectGeometryList(
leafAtom.source.getCurrentLocalToVworld(0), bound))))) {
return bh;
}
} else if (leaf instanceof GroupRetained) {
GroupRetained group = (GroupRetained) leaf;
if (((BHLeafNode) bh).isEnable() &&
group.sourceNode.collidable &&
bound.intersect(bh.bHull) &&
!isDescendent(group.sourceNode, armingGroup, group.key)) {
return bh;
}
}
return null;
case BHNode.BH_TYPE_INTERNAL:
if (bound.intersect(bh.bHull)) {
BHNode hitNode = doSelectAny(bound,
((BHInternalNode) bh).getRightChild(),
accurancyMode,
armingGroup);
if (hitNode != null)
return hitNode;
return doSelectAny(bound,
((BHInternalNode) bh).getLeftChild(),
accurancyMode,
armingGroup);
}
return null;
}
return null;
}
// Return true if node is a descendent of group
private boolean isDescendent(NodeRetained node,
GroupRetained group,
HashKey key) {
synchronized (group.universe.sceneGraphLock) {
if (node.inSharedGroup) {
// getlastNodeId() will destroy this key
if (key != null) {
key = new HashKey(key);
}
}
do {
if (node == group) {
return true;
}
if (node instanceof SharedGroupRetained) {
// retrieve the last node ID
String nodeId = key.getLastNodeId();
NodeRetained prevNode = node;
Vector<NodeRetained> parents = ((SharedGroupRetained)node).parents;
for(int i=parents.size()-1; i >=0; i--) {
NodeRetained link = parents.get(i);
if (link.nodeId.equals(nodeId)) {
node = link;
break;
}
}
if (prevNode == node) {
// branch is already detach
return true;
}
}
node = node.parent;
} while (node != null); // reach Locale
}
return false;
}
void select(PickShape pickShape, UnorderList hitArrList) {
if((pickShape == null)||(root == null))
return;
doSelect(pickShape, hitArrList, root, tPoint4d);
}
private void doSelect(PickShape pickShape, UnorderList hitArrList,
BHNode bh, Point4d pickPos) {
if ((bh == null) || (bh.bHull.isEmpty())) {
return;
}
switch(bh.nodeType) {
case BHNode.BH_TYPE_LEAF:
if (((BHLeafNode)(bh)).isEnable() &&
(((BHLeafNode) bh).leafIF instanceof GeometryAtom) &&
((GeometryAtom) (((BHLeafNode)
bh).leafIF)).source.isPickable &&
pickShape.intersect(bh.bHull, pickPos)) {
hitArrList.add(bh);
}
break;
case BHNode.BH_TYPE_INTERNAL:
if (pickShape.intersect(bh.bHull, pickPos)) {
doSelect(pickShape,
hitArrList,
((BHInternalNode)bh).getRightChild(),
pickPos);
doSelect(pickShape,
hitArrList,
((BHInternalNode)bh).getLeftChild(),
pickPos);
}
break;
}
}
BHNode selectAny(PickShape pickShape) {
if((pickShape == null)||(root == null))
return null;
return doSelectAny(pickShape, root, tPoint4d);
}
private BHNode doSelectAny(PickShape pickShape, BHNode bh, Point4d pickPos) {
BHNode hitNode = null;
if((bh == null) || (bh.bHull.isEmpty()))
return null;
switch(bh.nodeType) {
case BHNode.BH_TYPE_LEAF:
if (((BHLeafNode)(bh)).isEnable() &&
(((BHLeafNode) bh).leafIF instanceof GeometryAtom) &&
((GeometryAtom) (((BHLeafNode)
bh).leafIF)).source.isPickable &&
pickShape.intersect(bh.bHull, pickPos)) {
return bh;
}
break;
case BHNode.BH_TYPE_INTERNAL:
if (pickShape.intersect(bh.bHull, pickPos)) {
hitNode = doSelectAny(pickShape,
((BHInternalNode)bh).getRightChild(),
pickPos);
if (hitNode != null) {
return hitNode;
}
return doSelectAny(pickShape,
((BHInternalNode)bh).getLeftChild(),
pickPos);
}
break;
}
return null;
}
private void create(BHNode bhArr[]) {
int i;
if(bhArr == null) {
root = null;
return;
}
if(bhArr.length == 1) {
bhArr[0].computeBoundingHull();
root = (BHNode)bhArr[0];
return;
}
int centerValuesIndex[] = new int[bhArr.length];
float centerValues[][] = computeCenterValues(bhArr, centerValuesIndex);
/*
System.err.println("Length of array is " + bhArr.length);
for(int kk=0; kk<bhArr.length;kk++) {
System.err.println("( " + centerValues[kk][0] + ", " +
centerValues[kk][1] + ", " + centerValues[kk][2] + " )");
}
*/
root = new BHInternalNode();
constructTree((BHInternalNode) root, bhArr, centerValues,
centerValuesIndex);
if(J3dDebug.devPhase && J3dDebug.debug)
gatherTreeStatistics();
}
void insert(BHNode bhArr[], int size) {
// first pass: add all elements to the tree creating k array internal
// nodes using the auxiliaryInsertStucture
// second pass: go through all elements of the auxiliaryInsertStructure
// and then update these nodes reclustering the trees with the new
// k element siblings ...
if(J3dDebug.devPhase && J3dDebug.debug)
J3dDebug.doDebug(J3dDebug.bHTree, J3dDebug.LEVEL_4,
"BHTree.java : Insert - bhArr.length is " +
bhArr.length + "\n");
if((bhArr == null) || (size < 1) || (bhArr.length < 1))
return;
if(root == null) {
if(J3dDebug.devPhase)
J3dDebug.doDebug(J3dDebug.bHTree, J3dDebug.LEVEL_4,
"BHTree.java : Tree has not be created yet.\n");
// This extra "new" is needed, because create() require its input
// array's length be equal to the number of inserted nodes.
BHNode[] newbhArr = new BHNode[size];
System.arraycopy(bhArr, 0, newbhArr, 0, size);
create(newbhArr);
return;
}
if(root.nodeType == BHNode.BH_TYPE_LEAF) {
BHNode[] oldBhArr = bhArr;
bhArr = new BHNode[size + 1];
System.arraycopy(oldBhArr, 0, bhArr, 0, size);
bhArr[size] = root;
create(bhArr);
return;
}
if(insertStructure == null) {
insertStructure = new BHInsertStructure(size);
}
else {
insertStructure.clear();
}
for (int i=0; i<size; i++) {
// test if its inside the 'root' element
if ( root.isInside(bhArr[i].bHull) ) {
((BHInternalNode)root).insert(bhArr[i], insertStructure);
}
else {
// extend the bounds of root by joining with current element
root.bHull.combine(bhArr[i].bHull);
insertStructure.lookupAndInsert(root, bhArr[i]);
}
}
insertStructure.updateBoundingTree(this);
// System.err.println("BHTree - Inserting ...");
// Issue 353: clear temporary insertStructure so we don't leak.
insertStructure.clear();
// Guard against size<1 is done at the start of this method.
estMaxDepth += (int) (Math.log(size)/LOG_OF_2) + 1;
if(estMaxDepth > depthUpperBound) {
int maxDepth = root.computeMaxDepth(0);
int leafCount = root.countNumberOfLeaves();
double compDepth = Math.log(leafCount)/LOG_OF_2;
/*
System.err.println("BHTree - evaluate for reConstructTree ...");
System.err.println("compDepth " + compDepth);
System.err.println("maxDepth " + maxDepth);
System.err.println("leafCount " + leafCount);
*/
// Upper bound guard.
if(maxDepth > depthUpperBound) {
reConstructTree(leafCount);
maxDepth = root.computeMaxDepth(0);
/*
System.err.println("BHTree - Did reConstructTree ...");
System.err.println("compDepth " + compDepth);
System.err.println("maxDepth " + maxDepth);
*/
}
// Adjust depthUpperBound according to app. need.
// If we encounter lots of overlapping bounds, the re-balanced
// tree may not be an ideal balance tree. So there might be a
// likehood of maxDepth exceeding the preset depthUpperBound.
if(maxDepth > depthUpperBound) {
depthUpperBound = depthUpperBound + INCR_DEPTH_BOUND;
}else if((depthUpperBound != DEPTH_UPPER_BOUND) &&
(maxDepth * 1.5 < depthUpperBound)) {
depthUpperBound = depthUpperBound - INCR_DEPTH_BOUND;
if(depthUpperBound < DEPTH_UPPER_BOUND) {
// Be sure that DEPTH_UPPER_BOUND is the min.
depthUpperBound = DEPTH_UPPER_BOUND;
}
}
// This is the only place for resetting estMaxDepth to the tree real
// maxDepth. Hence in cases where tree may get deteriorate fast, such
// as multiple inserts and deletes frequently. estMaxDepth is accuminated,
// and will lead to tree re-evaluation and possibly re-balancing.
estMaxDepth = maxDepth;
}
}
// mark all elements of the node and its parent as needing updating
private void markParentChain(BHNode[] nArr, int size) {
BHNode node;
for(int i=0; i<size; i++) {
node = nArr[i];
node.mark = true;
while((node.parent != null) && (node.parent.mark == false)) {
node = node.parent;
node.mark = true;
}
}
}
// mark all elements of the node and its parent as needing updating
private void markParentChain(BHNode node) {
node.mark = true;
while((node.parent != null) && (node.parent.mark == false)) {
node = node.parent;
node.mark = true;
}
}
// Delete a series of n node elements from the input binary tree.
// These elements are removed from the tree in a 2 phase process.
// First, all elements to be removed are marked and all parent
// chains are marked ... then a second phase of the algorithm goes
// through and deletes them and updates all of the bounds ...
// delete the n elements in the array from the tree
void delete(BHNode bhArr[], int size) {
BHNode node;
/*
if((bhArr == null) || (bhArr.length < 1))
return;
System.err.println("BHTree.java : delete - bhArr.length is " +
bhArr.length);
for(int i=0; i<bhArr.length; i++)
System.err.println("bhArr[" + i +"] " + bhArr[i]);
*/
for(int i=0; i<size; i++) {
if((bhArr[i] != null) && (bhArr[i].nodeType == BHNode.BH_TYPE_LEAF)) {
markParentChain(bhArr[i]);
} else {
if(J3dDebug.devPhase)
J3dDebug.doDebug(J3dDebug.bHTree, J3dDebug.LEVEL_1,
"Warning, element " + i + " is null/not leaf node.\n"
+ "Error in deletion routine, element " +
bhArr[i] + "\n" +
"In tree = " + this +
" can not delete it ...\n");
}
}
root = root.deleteAndUpdateMarkedNodes();
if(J3dDebug.devPhase)
if (root == null) {
J3dDebug.doDebug(J3dDebug.bHTree, J3dDebug.LEVEL_4,
"Tree has been completely deleted ...\n");
}
}
// compute the center values along each of the three dimensions given
// the array of leaf objects to be split and joined
float[][] computeCenterValues(BHNode[] bhArr, int[] cIndex) {
float centers[][] = new float[bhArr.length][3];
// compute the center values of the input array of nodes
for ( int i=0; i < bhArr.length; i++ ) {
cIndex[i] = i;
bhArr[i].computeBoundingHull();
centers[i][0] =
(float)((bhArr[i].bHull.upper.x + bhArr[i].bHull.lower.x))/ 2.0f;
centers[i][1] =
(float)((bhArr[i].bHull.upper.y + bhArr[i].bHull.lower.y)) / 2.0f;
centers[i][2] =
(float)((bhArr[i].bHull.upper.z + bhArr[i].bHull.lower.z)) / 2.0f;
}
return centers;
}
void computeMeansAndSumSquares(float[][] centerValues, int[] centerValuesIndex,
float[] means, float[] ss) {
int i, arrLen;
float sumCenters[] = new float[3];
float temp = 0.0f;
arrLen = centerValuesIndex.length;
// Initialization.
for(i=2; i>=0; i--) {
sumCenters[i] = 0.0f;
ss[i] = 0.0f;
}
for(i=arrLen-1; i>=0 ; i--) {
sumCenters[0] += centerValues[centerValuesIndex[i]][0];
sumCenters[1] += centerValues[centerValuesIndex[i]][1];
sumCenters[2] += centerValues[centerValuesIndex[i]][2];
}
means[0] = sumCenters[0]/(float)arrLen;
means[1] = sumCenters[1]/(float)arrLen;
means[2] = sumCenters[2]/(float)arrLen;
for(i=arrLen-1; i>=0 ; i--) {
temp = (centerValues[centerValuesIndex[i]][0] - means[0]);
ss[0] += (temp*temp);
temp = (centerValues[centerValuesIndex[i]][1] - means[1]);
ss[1] += (temp*temp);
temp = (centerValues[centerValuesIndex[i]][2] - means[2]);
ss[2] += (temp*temp);
}
}
// find the split axis (the highest ss and return its index) for
// a given set of ss values
int findSplitAxis ( float ss[] ) {
int splitAxis = -1;
float maxSS = 0.0f;
// the largest ss index value
for (int i=0; i < 3; i++) {
if ( ss[i] > maxSS ) {
maxSS = ss[i];
splitAxis = i;
}
}
return splitAxis;
}
// Recursive method for constructing a binary tree.
void constructTree( BHInternalNode parent, BHNode bhArr[],
float[][] centerValues,
int[] centerValuesIndex ){
int i, splitAxis;
int rightSetCount = 0;
int leftSetCount = 0;
float means[] = new float[3];
float ss[] = new float[3];
if(J3dDebug.devPhase)
if ( bhArr.length <= 1 ) {
// this is only here for debugging can be removed after testing
// to ensure that it never gets called
J3dDebug.doDebug(J3dDebug.bHTree, J3dDebug.LEVEL_1,
"constructTree - bhArr.length <= 1. Bad !!!\n");
}
computeMeansAndSumSquares(centerValues, centerValuesIndex, means, ss);
splitAxis = findSplitAxis(ss);
// an array of decision variables for storing the values of inside
// the right or left set for a particular element of bhArr.
// true if its in the left set, false if its in the right set
boolean leftOrRightSet[] = new boolean[bhArr.length];
if ( splitAxis == -1 ) {
// This is bad. Since we can't find a split axis, the best thing
// to do is to split the set in two sets; each with about the
// same number of elements. By doing this we can avoid constructing
// a skew tree.
// split elements into half.
for ( i=0; i < bhArr.length; i++) {
if(leftSetCount > rightSetCount) {
rightSetCount++;
leftOrRightSet[i] = false;
} else {
leftSetCount++;
leftOrRightSet[i] = true;
}
}
}
else {
for ( i=0; i < bhArr.length; i++) {
// the split criterion, special multiple equals cases added
if ( centerValues[centerValuesIndex[i]][splitAxis] <
means[splitAxis]) {
if(J3dDebug.devPhase)
J3dDebug.doDebug(J3dDebug.bHTree, J3dDebug.LEVEL_4,
"Found a left element\n");
leftSetCount++;
leftOrRightSet[i] = true;
} else if ( centerValues[centerValuesIndex[i]][splitAxis] >
means[splitAxis]) {
if(J3dDebug.devPhase)
J3dDebug.doDebug(J3dDebug.bHTree, J3dDebug.LEVEL_4,
"Found a right element\n");
rightSetCount++;
leftOrRightSet[i] = false;
} else {
if(J3dDebug.devPhase)
J3dDebug.doDebug(J3dDebug.bHTree, J3dDebug.LEVEL_4,
"Found an equal element\n");
if(leftSetCount > rightSetCount) {
rightSetCount++;
leftOrRightSet[i] = false;
} else {
leftSetCount++;
leftOrRightSet[i] = true;
}
}
}
}
if(J3dDebug.devPhase)
J3dDebug.doDebug(J3dDebug.bHTree, J3dDebug.LEVEL_2,
"LeftSetCount " + leftSetCount + " RightSetCount "+
rightSetCount + "\n");
// Don't think that this guard is needed, but still like to have it.
// Just in case, bad means and the sum of squares might lead us into the guard.