@woosh/meep-engine 2.34.36 → 2.34.40

package/core/bvh2/BinaryNode.js

@@ -25,1146 +25,1152 @@ import { traverseBinaryNodeUsingVisitor } from "./traversal/traverseBinaryNodeUs
 
 /**
  *
- * @enum {int}
+ * @type {number}
  */
-const ModifierType = {
-    Protected: 1,
-    Marked1: 2,
-    Marked2: 4,
-    Marked3: 8
-};
-
+let stackPointer = 0;
 /**
- * @extends {Node}
- * @constructor
+ *
+ * @type {Node[]}
  */
-const BinaryNode = function () {
-    /**
-     *
-     * @type {null|BinaryNode|LeafNode}
-     */
-    this.parentNode = null;
-
-    /**
-     *
-     * @type {null|Node|LeafNode|BinaryNode}
-     */
-    this.left = null;
-    /**
-     *
-     * @type {null|Node|LeafNode|BinaryNode}
-     */
-    this.right = null;
+const stack = [];
 
-    this.modifiers = 0;
+export class BinaryNode extends Node {
+    constructor() {
+        super();
+
+        /**
+         *
+         * @type {null|BinaryNode|LeafNode}
+         */
+        this.parentNode = null;
+
+        /**
+         *
+         * @type {null|Node|LeafNode|BinaryNode}
+         */
+        this.left = null;
+
+        /**
+         *
+         * @type {null|Node|LeafNode|BinaryNode}
+         */
+        this.right = null;
+
+        /**
+         * Number of leaf nodes in the hierarchy
+         * @deprecated
+         * @type {number}
+         * @private
+         */
+        this.leafNodeCount = 0;
+
+        /**
+         * Leaf node will have height 0, root node will have height equal to maximum depth of the tree
+         * @type {number}
+         */
+        this.height = 0;
+    }
 
     /**
-     * Number of leaf nodes in the hierarchy
-     * @type {number}
+     * Same as traversePreOrder but without recursion. This runs faster thanks to avoidance of function call overhead. Especially useful for deeper trees.
+     * @param {BinaryNode~Visitor} visitor
+     * @param [thisArg]
+     * @deprecated use visitor-based traversal instead of callback-based
      */
-    this.leafNodeCount = 0;
-
-    this.x0 = 0;
-    this.y0 = 0;
-    this.z0 = 0;
-
-    this.x1 = 0;
-    this.y1 = 0;
-    this.z1 = 0;
-};
-
-BinaryNode.Modifier = ModifierType;
-
-BinaryNode.prototype = Object.create(Node.prototype);
-
-/**
- * @readonly
- * @type {boolean}
- */
-BinaryNode.prototype.isBinaryNode = true;
-
-/**
- *
- * @param {int} modifier
- * @param {boolean} flag
- */
-BinaryNode.prototype.setModifier = function (modifier, flag) {
-    if (flag) {
-        this.modifiers |= modifier;
-    } else {
-        this.modifiers &= ~modifier;
-    }
-};
-
-BinaryNode.prototype.isModifierSet = function (modifier) {
-    return (this.modifiers & modifier) !== 0;
-};
+    traversePreOrderUsingStack(visitor, thisArg) {
+        let visitCount = 0;
 
-BinaryNode.prototype.isProtected = function () {
-    return this.isModifierSet(ModifierType.Protected);
-};
+        const stackOffset = stackPointer;
 
-/**
- * Contains no children
- * @returns {boolean}
- */
-BinaryNode.prototype.isEmpty = function () {
-    return this.left === null && this.right === null;
-}
+        stack[stackPointer++] = this;
+        let n;
+        while (stackPointer-- > stackOffset) {
 
+            visitCount++;
 
-BinaryNode.prototype.reset = function () {
-    this.left = null;
-    this.right = null;
+            n = stack[stackPointer];
 
-    this.leafNodeCount = 0;
+            const traverseDeeper = visitor.call(thisArg, n);
 
-    this.setNegativelyInfiniteBounds();
-};
+            if (traverseDeeper !== false && n.isBinaryNode) {
+                if (n.right !== null) {
+                    stack[stackPointer++] = n.right;
+                }
+                if (n.left !== null) {
+                    stack[stackPointer++] = n.left;
+                }
+            }
+        }
 
-/**
- *
- * @param {Node|BinaryNode} left
- * @param {Node|BinaryNode} right
- */
-BinaryNode.prototype.setChildren = function (left, right) {
-    this.left = left;
-    this.right = right;
+        // drop stack frame
+        stackPointer = stackOffset;
 
-    this.updateLeafNodeCount()
+        return visitCount;
+    }
 
-    this.refitFor2();
+    /**
+     * Traverse leaf nodes in a fast manner
+     * @param {function(node:LeafNode)} visitor
+     * @param {*} [thisArg]
+     */
+    traverseLeavesPreOrderUsingStack(visitor, thisArg) {
+        let visitCount = 0;
 
-    left.parentNode = this;
-    right.parentNode = this;
-};
+        const stackOffset = stackPointer;
 
-/**
- *
- * @param {Node} child
- */
-BinaryNode.prototype.setChildLeft = function (child) {
-    assert.isNull(this.left, 'left');
+        stack[stackPointer++] = this;
 
-    this.left = child;
+        let n;
 
-    this.updateLeafNodeCount();
+        while (stackPointer-- > stackOffset) {
 
-    this.refit();
+            visitCount++;
 
-    child.parentNode = this;
-}
+            n = stack[stackPointer];
 
-/**
- *
- * @param {Node} child
- */
-BinaryNode.prototype.setChildRight = function (child) {
-    assert.isNull(this.right, 'right');
+            if (n.isLeafNode) {
+                visitor.call(thisArg, n);
+            } else {
+                //a binary node
+                if (n.right !== null) {
+                    stack[stackPointer++] = n.right;
+                }
+                if (n.left !== null) {
+                    stack[stackPointer++] = n.left;
+                }
+            }
+        }
 
-    this.right = child;
+        // drop stack frame
+        stackPointer = stackOffset;
 
-    this.updateLeafNodeCount();
+        return visitCount;
+    }
 
-    this.refit();
 
-    child.parentNode = this;
-}
+    /**
+     * Contains no children
+     * @returns {boolean}
+     */
+    isEmpty() {
+        return this.left === null && this.right === null;
+    }
 
-/**
- * @see "Dynamic BVH" by Erin Catto / Blizzard
- * @param {AABB3} node
- * @param {AABB3} addition
- * @returns {number}
- */
-function inclusion_surface_area_heuristic(node, addition) {
-    const x0 = min2(node.x0, addition.x0);
-    const y0 = min2(node.y0, addition.y0);
-    const z0 = min2(node.z0, addition.z0);
+    reset() {
+        this.left = null;
+        this.right = null;
 
-    const x1 = max2(node.x1, addition.x1);
-    const y1 = max2(node.y1, addition.y1);
-    const z1 = max2(node.z1, addition.z1);
+        this.leafNodeCount = 0;
+        this.height = 0;
 
-    return _boxSurfaceArea2(x0, y0, z0, x1, y1, z1) - boxSurfaceArea2(node);
-}
+        this.setNegativelyInfiniteBounds();
+    }
 
-/**
- *
- * @param {BinaryNode|LeafNode} node
- * @param {AABB3} addition
- */
-function inclusion_cost_lower_bound(node, addition) {
-    let n = node;
-    let r = boxSurfaceArea2(addition);
+    /**
+     *
+     * @param {Node|BinaryNode} left
+     * @param {Node|BinaryNode} right
+     */
+    setChildren(left, right) {
+        this.left = left;
+        this.right = right;
 
-    while (n !== null) {
+        left.parentNode = this;
+        right.parentNode = this;
+    }
 
-        r += n.costForInclusion(addition);
+    /**
+     *
+     * @param {Node} child
+     */
+    setChildLeft(child) {
+        assert.isNull(this.left, 'left');
 
-        n = n.parentNode;
+        this.left = child;
+        child.parentNode = this;
     }
 
-    return r;
-}
-
-/**
- * For incremental insertion, a sibling needs to be found, newly inserted node will be parented together with this sibling
- * @param {AABB3} box
- * @returns {BinaryNode|LeafNode}
- */
-BinaryNode.prototype.__insertion_findSiblingFor = function (box) {
+    /**
+     *
+     * @param {Node} child
+     */
+    setChildRight(child) {
+        assert.isNull(this.right, 'right');
 
-    const open_set = [this];
-    let cursor = 1;
+        this.right = child;
+        child.parentNode = this;
+    }
 
-    let best_cost = Infinity;
-    let best_node = this;
+    /**
+     * For incremental insertion, a sibling needs to be found, newly inserted node will be parented together with this sibling
+     * @see https://github.com/erincatto/box2d/blob/9dc24a6fd4f32442c4bcf80791de47a0a7d25afb/src/collision/b2_dynamic_tree.cpp#L197
+     * @param {AABB3} box
+     * @returns {BinaryNode|LeafNode}
+     */
+    __insertion_findSiblingFor(box) {
 
-    while (cursor > 0) {
-        const node = open_set[--cursor];
+        const open_set = [this];
+        let cursor = 1;
 
-        const cost = inclusion_surface_area_heuristic(node, box);
+        let best_cost = Infinity;
+        let best_node = this;
 
-        if (cost < best_cost) {
-            best_cost = cost;
-            best_node = node;
-        }
+        while (cursor > 0) {
+            const node = open_set[--cursor];
 
-        if (node.isBinaryNode) {
+            const cost = inclusion_surface_area_heuristic(node, box);
 
-            if (node.isProtected()) {
-                continue;
+            if (cost < best_cost) {
+                best_cost = cost;
+                best_node = node;
             }
 
-            // consider pushing children into the queue
+            if (node.isBinaryNode) {
 
-            // compute lower bound for cost
-            const c_low = inclusion_cost_lower_bound(node, box);
+                // consider pushing children into the queue
 
-            if (c_low < best_cost) {
-                // worth-while to explore children
-                if (node.left !== null) {
-                    open_set[cursor++] = node.left;
-                }
-                if (node.right !== null) {
-                    open_set[cursor++] = node.right
+                // compute lower bound for cost
+                const c_low = inclusion_cost_lower_bound(node, box);
+
+                if (c_low < best_cost) {
+                    // worth-while to explore children
+                    if (node.left !== null) {
+                        open_set[cursor++] = node.left;
+                    }
+                    if (node.right !== null) {
+                        open_set[cursor++] = node.right
+                    }
                 }
             }
-        }
-
 
-    }
-
-    return best_node;
-}
-
-/**
- *
- * @param {AABB3} box
- * @returns {Node|BinaryNode|LeafNode}
- */
-BinaryNode.prototype.findParentFor = function (box) {
-    let n = this;
-    let aCost = 0;
-    let bCost = 0;
 
-    for (; ;) {
+        }
 
-        const a = n.left;
-        const b = n.right;
+        return best_node;
+    }
 
-        if (a === null || b === null) {
-            //unbalanced node, good candidate already
-            return n;
-        }
+    /**
+     *
+     * @param {AABB3} box
+     * @returns {Node|BinaryNode|LeafNode}
+     */
+    findParentFor(box) {
+        let n = this;
+        let aCost = 0;
+        let bCost = 0;
 
-        const aIsBinary = a.isBinaryNode;
-        const bIsBinary = b.isBinaryNode;
+        for (; ;) {
 
-        // handle protected nodes
-        if (aIsBinary && a.isProtected()) {
-            if (bIsBinary) {
-                if (b.isProtected()) {
-                    return n;
-                } else {
-                    n = b;
+            const a = n.left;
+            const b = n.right;
 
-                    continue;
-                }
-            } else {
-                return b;
+            if (a === null || b === null) {
+                //unbalanced node, good candidate already
+                return n;
             }
-        } else if (bIsBinary && b.isProtected()) {
-            if (aIsBinary) {
-                n = a;
-            } else {
-                return a;
-            }
-        }
 
-        aCost = a.costForInclusion(box);
-        bCost = b.costForInclusion(box);
+            const aIsBinary = a.isBinaryNode;
+            const bIsBinary = b.isBinaryNode;
 
-        if (aCost === bCost) {
+            aCost = a.costForInclusion(box);
+            bCost = b.costForInclusion(box);
 
-            if (a.isLeafNode) {
+            if (aCost === bCost) {
 
-                return a;
+                if (a.isLeafNode) {
 
-            } else if (b.isLeafNode) {
+                    return a;
 
-                return b;
+                } else if (b.isLeafNode) {
 
-            }
+                    return b;
 
-            //change costs to be based on balance
-            aCost = a.leafNodeCount / boxSurfaceArea2(a);
-            bCost = b.leafNodeCount / boxSurfaceArea2(b);
-        }
+                }
 
-        if (aCost === bCost) {
-            //still the same, toss a coin
-            aCost = Math.random();
-            bCost = 1 - aCost;
-        }
+                //change costs to be based on balance
+                aCost = a.leafNodeCount / boxSurfaceArea2(a);
+                bCost = b.leafNodeCount / boxSurfaceArea2(b);
+            }
 
-        if (aCost < bCost) {
-            if (aIsBinary) {
-                n = a;
-            } else {
-                return a;
+            if (aCost === bCost) {
+                //still the same, toss a coin
+                aCost = Math.random();
+                bCost = 1 - aCost;
             }
-        } else {
-            if (bIsBinary) {
-                n = b;
+
+            if (aCost < bCost) {
+                if (aIsBinary) {
+                    n = a;
+                } else {
+                    return a;
+                }
             } else {
-                return b;
+                if (bIsBinary) {
+                    n = b;
+                } else {
+                    return b;
+                }
             }
         }
     }
-};
 
-BinaryNode.prototype.traverse = function (visitor) {
-    if (this.left !== null) {
-        const cA = visitor(this.left);
-        if (cA !== false) {
-            this.left.traverse(visitor);
+    traverse(visitor) {
+        if (this.left !== null) {
+            const cA = visitor(this.left);
+            if (cA !== false) {
+                this.left.traverse(visitor);
+            }
         }
-    }
-    if (this.right !== null) {
-        const cB = visitor(this.right);
-        if (cB !== false) {
-            this.right.traverse(visitor);
+        if (this.right !== null) {
+            const cB = visitor(this.right);
+            if (cB !== false) {
+                this.right.traverse(visitor);
+            }
         }
     }
-};
 
-/**
- * Bottom-up tree traversal, children first
- * @param visitor
- */
-BinaryNode.prototype.traversePostOrder = function (visitor) {
-    //left
-    if (this.left instanceof BinaryNode) {
-        this.left.traversePostOrder(visitor);
-    } else if (this.left instanceof LeafNode) {
-        visitor(this.left);
-    }
-    //right
-    if (this.right instanceof BinaryNode) {
-        this.right.traversePostOrder(visitor);
-    } else if (this.right instanceof LeafNode) {
-        visitor(this.right);
-    }
-    visitor(this);
-};
-BinaryNode.prototype.traversePreOrder = function (visitor) {
-    const carryOn = visitor(this);
-    if (carryOn !== false) {
+    /**
+     * Bottom-up tree traversal, children first
+     * @param visitor
+     */
+    traversePostOrder(visitor) {
         //left
         if (this.left instanceof BinaryNode) {
-            this.left.traversePreOrder(visitor);
+            this.left.traversePostOrder(visitor);
         } else if (this.left instanceof LeafNode) {
             visitor(this.left);
         }
         //right
         if (this.right instanceof BinaryNode) {
-            this.right.traversePreOrder(visitor);
+            this.right.traversePostOrder(visitor);
         } else if (this.right instanceof LeafNode) {
             visitor(this.right);
         }
+        visitor(this);
     }
-};
-
 
-/**
- * Same as traversePreOrder but without recursion. This runs faster thanks to avoidance of function call overhead. Especially useful for deeper trees.
- * @param {BinaryNode~Visitor} visitor
- * @param thisArg
- * @deprecated use visitor-based traversal instead of callback-based
- */
-BinaryNode.prototype.traversePreOrderUsingStack = (function (visitor, thisArg) {
+    traversePreOrder(visitor) {
+        const carryOn = visitor(this);
+        if (carryOn !== false) {
+            //left
+            if (this.left instanceof BinaryNode) {
+                this.left.traversePreOrder(visitor);
+            } else if (this.left instanceof LeafNode) {
+                visitor(this.left);
+            }
+            //right
+            if (this.right instanceof BinaryNode) {
+                this.right.traversePreOrder(visitor);
+            } else if (this.right instanceof LeafNode) {
+                visitor(this.right);
+            }
+        }
+    }
 
+    refitFor2() {
+        const a = this.left;
+        const b = this.right;
 
-    let stackPointer = 0;
-    const stack = [];
+        this.x0 = min2(a.x0, b.x0);
+        this.y0 = min2(a.y0, b.y0);
+        this.z0 = min2(a.z0, b.z0);
 
-    function cleanup(position) {
-        stack.length = position;
-        stackPointer = position;
+        this.x1 = max2(a.x1, b.x1);
+        this.y1 = max2(a.y1, b.y1);
+        this.z1 = max2(a.z1, b.z1);
     }
 
-    /**
-     * @param {BinaryNode~Visitor} visitor
-     * @param {*} [thisArg]
-     * @returns {number}
-     */
-    function traversePreOrderUsingStack(visitor, thisArg) {
-        let visitCount = 0;
+    bubbleRefit() {
+        let n = this;
 
-        const stackOffset = stackPointer;
+        n.refit();
 
-        stack[stackPointer++] = this;
-        let n;
-        while (stackPointer-- > stackOffset) {
+        //bubble up
+        for (; ;) {
+            //record old node size
+            const _x0 = n.x0;
+            const _y0 = n.y0;
+            const _z0 = n.z0;
+            const _x1 = n.x1;
+            const _y1 = n.y1;
+            const _z1 = n.z1;
 
-            visitCount++;
+            n = n.parentNode;
 
-            n = stack[stackPointer];
+            if (n === null) {
+                // hit the root
+                return;
+            }
 
-            const traverseDeeper = visitor.call(thisArg, n);
 
-            if (traverseDeeper !== false && n.isBinaryNode) {
-                if (n.right !== null) {
-                    stack[stackPointer++] = n.right;
-                }
-                if (n.left !== null) {
-                    stack[stackPointer++] = n.left;
-                }
+            //check if this node violates bounds of the parent
+            let flag = false;
+
+            if (_x0 < n.x0) {
+                n.x0 = _x0;
+                flag = true;
+            }
+            if (_y0 < n.y0) {
+                n.y0 = _y0;
+                flag = true;
+            }
+            if (_z0 < n.z0) {
+                n.z0 = _z0;
+                flag = true;
             }
-        }
 
-        cleanup(stackOffset);
+            if (_x1 > n.x1) {
+                n.x1 = _x1;
+                flag = true;
+            }
+            if (_y1 > n.y1) {
+                n.y1 = _y1;
+                flag = true;
+            }
+            if (_z1 > n.z1) {
+                n.z1 = _z1;
+                flag = true;
+            }
 
-        return visitCount;
+            if (!flag) {
+                //no violation, we can stop here
+                break;
+            }
+        }
     }
 
-    return traversePreOrderUsingStack;
-})();
-
-/**
- * Traverse leaf nodes in a fast manner
- * @param {function(node:LeafNode)} visitor
- * @param {*} [thisArg]
- */
-BinaryNode.prototype.traverseLeavesPreOrderUsingStack = (function (visitor, thisArg) {
+    refit() {
+        if (this.left !== null && this.right !== null) {
+            this.refitFor2();
+        } else if (this.left !== null) {
+            this.copy(this.left);
+        } else if (this.right !== null) {
+            this.copy(this.right);
+        }
+    }
 
+    sumSurfaceArea() {
+        let result = 0;
+        this.traversePreOrderUsingStack(function (node) {
+            const nodeArea = node.computeSurfaceArea();
+            result += nodeArea;
+        });
 
-    let stackPointer = 0;
-    const stack = [];
+        return result;
+    }
 
-    function cleanup(position) {
-        stack.length = position;
-        stackPointer = position;
+    countDescendants() {
+        let result = 0;
+        this.traversePreOrderUsingStack(function (node) {
+            result++;
+        });
+        return result;
     }
 
     /**
-     * @param {function(node:LeafNode)} visitor
-     * @param {*} [thisArg]
-     * @returns {number}
+     * @deprecated Incorrect usage of SAH
+     * @return {number}
      */
-    function traverseLeavesPreOrderUsingStack(visitor, thisArg) {
-        let visitCount = 0;
+    computeSAH() {
+        let leftLeaves, rightLeaves, leftArea, rightArea;
 
-        const stackOffset = stackPointer;
+        const left = this.left;
 
-        stack[stackPointer++] = this;
+        if (left === null) {
+            leftArea = 0;
+            leftLeaves = 0;
+        } else {
+            leftArea = boxSurfaceArea2(left);
+            leftLeaves = left.leafNodeCount;
+        }
 
-        let n;
+        const right = this.right;
+        if (right === null) {
+            rightArea = 0;
+            rightLeaves = 0;
+        } else {
+            rightArea = boxSurfaceArea2(right);
+            rightLeaves = right.leafNodeCount;
+        }
 
-        while (stackPointer-- > stackOffset) {
+        const thisArea = boxSurfaceArea2(this);
 
-            visitCount++;
+        return surfaceAreaHeuristic(thisArea, leftArea, rightArea, leftLeaves, rightLeaves);
+    }
 
-            n = stack[stackPointer];
+    updateHeight() {
+        let node = this;
+        let n = 0;
 
-            if (n.isLeafNode) {
-                visitor.call(thisArg, n);
-            } else {
-                //a binary node
-                if (n.right !== null) {
-                    stack[stackPointer++] = n.right;
-                }
-                if (n.left !== null) {
-                    stack[stackPointer++] = n.left;
-                }
+        while (node !== null) {
+            n = 0;
+
+            const right = node.right;
+
+            if (right !== null) {
+                n = right.height;
             }
-        }
 
-        cleanup(stackOffset);
+            const left = this.left;
 
-        return visitCount;
-    }
+            if (left !== null) {
+                n = max2(n, left.height);
+            }
 
-    return traverseLeavesPreOrderUsingStack;
-})();
+            node.height = n + 1;
 
-BinaryNode.prototype.refitFor2 = function () {
-    const a = this.left;
-    const b = this.right;
+            // propagate update up the tree
+            node = node.parentNode;
+        }
+    }
 
-    this.x0 = min2(a.x0, b.x0);
-    this.y0 = min2(a.y0, b.y0);
-    this.z0 = min2(a.z0, b.z0);
+    /**
+     * @deprecated
+     */
+    updateLeafNodeCount() {
+        let node = this;
 
-    this.x1 = max2(a.x1, b.x1);
-    this.y1 = max2(a.y1, b.y1);
-    this.z1 = max2(a.z1, b.z1);
-};
+        while (node !== null) {
+            let n = 0;
 
-BinaryNode.prototype.bubbleRefit = function () {
-    let n = this;
+            const right = node.right;
 
-    n.refit();
+            if (right !== null) {
+                if (right.isLeafNode) {
+                    n++;
+                } else {
+                    n += right.leafNodeCount;
+                }
+            }
 
-    //bubble up
-    for (; ;) {
-        //record old node size
-        const _x0 = n.x0;
-        const _y0 = n.y0;
-        const _z0 = n.z0;
-        const _x1 = n.x1;
-        const _y1 = n.y1;
-        const _z1 = n.z1;
+            const left = this.left;
 
-        n = n.parentNode;
+            if (left !== null) {
+                if (left.isLeafNode) {
+                    n++;
+                } else {
+                    n += left.leafNodeCount;
+                }
+            }
+
+            node.leafNodeCount = n;
 
-        if (n === null) {
-            // hit the root
-            return;
+            // propagate update up the tree
+            node = node.parentNode;
         }
 
+    }
 
-        //check if this node violates bounds of the parent
-        let flag = false;
+    /**
+     * As a result of rotation, this node 'becomes' the right node, and left node get's replaced by the right node with necessary adjustments
+     */
+    rotateLeft() {
 
-        if (_x0 < n.x0) {
-            n.x0 = _x0;
-            flag = true;
-        }
-        if (_y0 < n.y0) {
-            n.y0 = _y0;
-            flag = true;
-        }
-        if (_z0 < n.z0) {
-            n.z0 = _z0;
-            flag = true;
-        }
+        /**
+         *
+         * @type {BinaryNode}
+         */
+        const r = this.right;
 
-        if (_x1 > n.x1) {
-            n.x1 = _x1;
-            flag = true;
-        }
-        if (_y1 > n.y1) {
-            n.y1 = _y1;
-            flag = true;
-        }
-        if (_z1 > n.z1) {
-            n.z1 = _z1;
-            flag = true;
+        const l = this.left;
+
+        const rL = r.left;
+        const rR = r.right;
+
+        this.left = r;
+        this.right = rR;
+
+        if (rR !== null) {
+            rR.parentNode = this;
         }
 
-        if (!flag) {
-            //no violation, we can stop here
-            break;
+        r.left = l;
+        if (l !== null) {
+            l.parentNode = r;
         }
+
+        r.right = rL;
+
+        r.updateLeafNodeCount();
+        r.updateHeight();
+
+        r.bubbleRefit();
     }
-};
-BinaryNode.prototype.refit = function () {
-    if (this.left !== null && this.right !== null) {
-        this.refitFor2();
-    } else if (this.left !== null) {
-        this.copy(this.left);
-    } else if (this.right !== null) {
-        this.copy(this.right);
-    }
-};
 
-/**
- *
- * @param {Node} n0
- * @param {Node} n1
- * @return {number}
- */
-function sortMortonCodes(n0, n1) {
-    return n0._mortonCode - n1._mortonCode;
-}
+    rotateRight() {
+        const r = this.right;
 
-BinaryNode.prototype.sumSurfaceArea = function () {
-    let result = 0;
-    this.traversePreOrderUsingStack(function (node) {
-        const nodeArea = node.computeSurfaceArea();
-        result += nodeArea;
-    });
+        const left = this.left;
 
-    return result;
-};
+        const lL = left.left;
+        const lR = left.right;
 
-BinaryNode.prototype.countDescendants = function () {
-    let result = 0;
-    this.traversePreOrderUsingStack(function (node) {
-        result++;
-    });
-    return result;
-};
+        if (lL !== null) {
+            lL.parentNode = this;
+        }
 
+        left.right = r;
+        if (r !== null) {
+            r.parentNode = left;
+        }
 
-/**
- *
- * @param node
- */
-function countLeaves(node) {
-    if (isLeaf(node)) {
-        return 1;
+        left.left = lR;
+
+        left.updateLeafNodeCount();
+        left.updateHeight();
+
+        left.bubbleRefit();
     }
 
-    let result = 0;
+    /**
+     *
+     * @param {function(index:int):LeafNode} leafFactory
+     * @param {int} numNodes
+     */
+    insertManyBoxes2(leafFactory, numNodes) {
+        let i, n;
+        //create leaf nodes
+        const nodes = new Array(numNodes);
 
-    node.traversePreOrderUsingStack(function (node) {
-        if (isLeaf(node)) {
-            result++;
-        }
-    });
+        for (i = 0; i < numNodes; i++) {
+            //leaf needs to be set up inside the callback
+            n = leafFactory(i);
 
-    return result;
-}
+            nodes[i] = n;
+        }
 
-/**
- * @deprecated Incorrect usage of SAH
- * @return {number}
- */
-BinaryNode.prototype.computeSAH = function () {
-    let leftLeaves, rightLeaves, leftArea, rightArea;
+        //sort leaves
+        arrayQuickSort(nodes, n => n.computeMortonCode(), null, 0, max2(0, numNodes - 1));
 
-    const left = this.left;
+        let remaining_nodes = numNodes;
 
-    if (left === null) {
-        leftArea = 0;
-        leftLeaves = 0;
-    } else {
-        leftArea = boxSurfaceArea2(left);
-        leftLeaves = left.leafNodeCount;
-    }
+        while (remaining_nodes > 2) {
 
-    const right = this.right;
-    if (right === null) {
-        rightArea = 0;
-        rightLeaves = 0;
-    } else {
-        rightArea = boxSurfaceArea2(right);
-        rightLeaves = right.leafNodeCount;
-    }
+            //pair
+            for (i = 0; i < remaining_nodes - 1; i += 2) {
+                const a = nodes[i];
+                const b = nodes[i + 1];
 
-    const thisArea = boxSurfaceArea2(this);
+                n = new BinaryNode();
 
-    return surfaceAreaHeuristic(thisArea, leftArea, rightArea, leftLeaves, rightLeaves);
-};
+                n.setChildren(a, b);
 
-BinaryNode.prototype.updateLeafNodeCount = function () {
-    let node = this;
+                n.updateHeight();
+                n.refitFor2();
 
-    while (node !== null) {
-        let n = 0;
+                nodes[i >> 1] = n;
+            }
 
-        const right = node.right;
+            const numNodesMod2 = remaining_nodes & 1; //faster version of %2
 
-        if (right !== null) {
-            if (right.isLeafNode) {
-                n++;
-            } else {
-                n += right.leafNodeCount;
+            if (numNodesMod2 !== 0) {
+                //shift remaining node up so it will be considered later
+                nodes[i >> 1] = nodes[i];
             }
+
+            remaining_nodes = (remaining_nodes >> 1) + numNodesMod2;
         }
 
-        const left = this.left;
+        //finally insert these boxes from this node
+        for (i = 0; i < remaining_nodes; i++) {
+            n = nodes[i];
+            this.insertNode(n);
+        }
+    }
 
-        if (left !== null) {
-            if (left.isLeafNode) {
-                n++;
-            } else {
-                n += left.leafNodeCount;
+    /**
+     *
+     * @param {LeafNode[]} result destination
+     * @param {number} x0
+     * @param {number} y0
+     * @param {number} z0
+     * @param {number} x1
+     * @param {number} y1
+     * @param {number} z1
+     * @returns {number} number of objects added to the result
+     */
+    requestLeafIntersectionsAABB3(result, x0, y0, z0, x1, y1, z1) {
+        const startOffset = stackPointer;
+
+        stack[stackPointer++] = this;
+
+        let count = 0;
+
+        while (stackPointer > startOffset) {
+            stackPointer--;
+            const node = stack[stackPointer];
+
+            if (!aabb3_intersect_aabb3(
+                x0, y0, z0, x1, y1, z1,
+                node.x0, node.y0, node.z0, node.x1, node.y1, node.z1
+            )) {
+                //no overlap
+                continue;
             }
-        }
 
-        node.leafNodeCount = n;
+            if (node.isLeafNode) {
+                result[count++] = node;
 
-        // propagate update up the tree
-        node = node.parentNode;
-    }
+                count++;
+            } else {
+                const left = node.left;
+                if (left !== null) {
+                    stack[stackPointer++] = left;
+                }
 
-}
+                const right = node.right;
+                if (right !== null) {
+                    stack[stackPointer++] = right;
+                }
+            }
+        }
 
+        return count;
+    }
 
-/**
- * As a result of rotation, this node 'becomes' the right node, and left node get's replaced by the right node with necessary adjustments
- */
-BinaryNode.prototype.rotateLeft = function () {
+    traverseSegmentLeafIntersections(startX, startY, startZ, endX, endY, endZ, visitor) {
+        this.traversePreOrder(function (node) {
+            let b = node.intersectSegment(startX, startY, startZ, endX, endY, endZ);
+            if (!b) {
+                return false;
+            }
+            if (node instanceof LeafNode) {
+                visitor(node);
+                return false;
+            } else {
+                return true;
+            }
+        });
+    }
 
     /**
      *
-     * @type {BinaryNode}
+     * @param {Frustum[]} frustums Collection of THREE.js Frustums
+     * @param {function(node:LeafNode, boolean)} visitor
+     * @returns {number}
+     * @deprecated Use {@link ThreeFrustumsIntersectionBVHVisitor}
      */
-    const r = this.right;
+    threeTraverseFrustumsIntersections(frustums, visitor) {
+        const numFrustums = frustums.length;
 
-    const l = this.left;
+        /**
+         *
+         * @param {LeafNode|BinaryNode} node
+         * @returns {boolean}
+         */
+        function visitNode(node) {
+            let b = false;
+            let i = 0;
 
-    const rL = r.left;
-    const rR = r.right;
+            for (; i < numFrustums; i++) {
 
-    this.left = r;
-    this.right = rR;
+                const degree = node.intersectFrustumDegree(frustums[i]);
 
-    if (rR !== null) {
-        rR.parentNode = this;
-    }
+                if (degree === 2) {
+                    //completely inside frustum
 
-    r.left = l;
-    if (l !== null) {
-        l.parentNode = r;
-    }
+                    if (node.isLeafNode) {
+                        visitor(node, true);
+                    } else {
+                        node.traverseLeavesPreOrderUsingStack(fastVisitLeafNodeIntersection, visitor);
+                    }
 
-    r.right = rL;
+                    //prevent further traversal
+                    return false;
 
-    r.updateLeafNodeCount();
+                } else if (degree === 1) {
 
-    r.bubbleRefit();
-};
+                    //partially inside frustum
+                    b = true;
 
-BinaryNode.prototype.rotateRight = function () {
-    const r = this.right;
+                }
+            }
 
-    const l = this.left;
+            if (!b) {
+                return false;
+            }
 
-    const lL = l.left;
-    const lR = l.right;
+            if (node.isLeafNode) {
+                visitor(node, false);
+            }
 
-    if (lL !== null) {
-        lL.parentNode = this;
-    }
+            return true;
+        }
 
-    l.right = r;
-    if (r !== null) {
-        r.parentNode = l;
+        return this.traversePreOrderUsingStack(visitNode);
     }
 
-    l.left = lR;
+    /**
+     * As recursion goes on, we remove frustums and planes from checks reducing total number of checks necessary
+     * @param {Array.<THREE.Frustum>} frustums
+     * @param {function} visitor
+     * @returns {number}
+     */
+    threeTraverseFrustumsIntersections2(frustums, visitor) {
+        const numFrustums = frustums.length;
 
-    l.updateLeafNodeCount();
+        function visitLeaves(node) {
+            if (node instanceof LeafNode) {
+                visitor(node);
+                return false;
+            } else {
+                return true;
+            }
+        }
 
-    l.bubbleRefit();
-};
+        function fastTraverseLeaves(node) {
+            if (node instanceof LeafNode) {
+                visitor(node);
+            } else {
+                node.traversePreOrderUsingStack(visitLeaves);
+            }
+        }
 
-/**
- *
- * @param {function(index:int):LeafNode} leafFactory
- * @param {int} numNodes
- */
-BinaryNode.prototype.insertManyBoxes2 = function (leafFactory, numNodes) {
-    let i, n;
-    //create leaf nodes
-    const nodes = new Array(numNodes);
 
-    for (i = 0; i < numNodes; i++) {
-        //leaf needs to be set up inside the callback
-        n = leafFactory(i);
+        function isFlagSet(mask, index) {
+            return mask & (1 << index) !== 0;
+        }
 
-        nodes[i] = n;
-    }
+        function clearFlag(mask, index) {
+            return mask & ~(1 << index);
+        }
 
-    //sort leaves
-    arrayQuickSort(nodes, n => n.computeMortonCode(), null, 0, max2(0, numNodes - 1));
+        function removeElementFromClone(original, clone, mask, originalIndex) {
+            if (clone === original) {
+                //clone planes
+                clone = clone.slice();
+            }
+            //remove the plane from new set
+            clone.splice(originalIndex, 1);
+            return clone;
+        }
 
-    let remaining_nodes = numNodes;
+        function processVolumesIntersections(node, planeSets, planeSetCount) {
+            let newPlaneSets = planeSets;
+            for (let iPS = planeSetCount - 1; iPS >= 0; iPS--) {
+
+                const planes = planeSets[iPS];
+                let newPlanes = planes;
+                const numPlanes = planes.length;
+
+                //check plane set
+                for (let i = numPlanes - 1; i >= 0; i--) {
+                    const plane = planes[i];
+                    const planeSide = node.computePlaneSide(plane);
+                    if (planeSide < 0) {
+                        //completely inside
+                        newPlanes = removeElementFromClone(planes, newPlanes, i);
+                    } else if (planeSide > 0) {
+                        //on the wrong side of the plane
+                        //drop plane set
+                        newPlaneSets = removeElementFromClone(planeSets, newPlaneSets, iPS);
+
+                        break;
+                    }
+                }
 
-    while (remaining_nodes > 2) {
+                //update plane sets as needed
+                if (newPlanes !== planes && newPlaneSets.indexOf(planes) !== -1) {
+                    //replace
+                    if (newPlaneSets === planeSets) {
+                        //clone if needed
+                        newPlaneSets = newPlaneSets.slice();
+                    }
+                    newPlaneSets[iPS] = newPlanes;
+                }
+            }
 
-        //pair
-        for (i = 0; i < remaining_nodes - 1; i += 2) {
-            const a = nodes[i];
-            const b = nodes[i + 1];
-            n = new BinaryNode();
-            n.setChildren(a, b);
-            nodes[i >> 1] = n;
+            return newPlaneSets;
         }
 
-        const numNodesMod2 = remaining_nodes & 1; //faster version of %2
+        function traverseVolumeIntersections(node, planeSets, numPlaneSets) {
+            function internalVisitor(node) {
+                let newPlaneSet = processVolumesIntersections(node, planeSets, numPlaneSets);
+                if (newPlaneSet !== planeSets) {
+                    let newPlaneSetCount = newPlaneSet.length;
+                    if (newPlaneSetCount !== 0) {
+                        //some intersections
+
+                        //check if all plane sets are trivial (contain no test planes)
+                        let trivialPlaneSets = 0;
+                        for (let i = 0; i < newPlaneSetCount; i++) {
+                            if (newPlaneSet[i].length === 0) {
+                                trivialPlaneSets++;
+                            }
+                        }
+
+                        if (isLeaf(node)) {
+                            visitor(node);
+                        } else {
+                            if (trivialPlaneSets === newPlaneSetCount) {
+                                fastTraverseLeaves(node);
+                            } else {
+                                traverseVolumeIntersections(node, newPlaneSet, newPlaneSetCount);
+                            }
+                        }
+                    }
+                } else {
+                    if (isLeaf(node)) {
+                        visitor(node);
+                    } else {
+                        return true;
+                    }
+                }
+
+                return false;
+            }
 
-        if (numNodesMod2 !== 0) {
-            //shift remaining node up so it will be considered later
-            nodes[i >> 1] = nodes[i];
+            node.traversePreOrderUsingStack(internalVisitor);
         }
 
-        remaining_nodes = (remaining_nodes >> 1) + numNodesMod2;
-    }
+        function startTraversal(node) {
+            let planeSets = [];
+            for (let i = 0; i < numFrustums; i++) {
+                const frustum = frustums[i];
+                const planes = frustum.planes;
+                planeSets.push(planes);
+            }
+            traverseVolumeIntersections(node, planeSets, numFrustums);
+        }
 
-    //finally insert these boxes from this node
-    for (i = 0; i < remaining_nodes; i++) {
-        n = nodes[i];
-        this.insertNode(n);
+        startTraversal(this);
     }
-};
-
 
-let stackPointer = 0;
-/**
- *
- * @type {Node[]}
- */
-const stack = [];
+    /**
+     *
+     * @param {number} startX
+     * @param {number} startY
+     * @param {number} startZ
+     * @param {number} directionX
+     * @param {number} directionY
+     * @param {number} directionZ
+     * @param {function(node:LeafNode)} visitor
+     * @param thisArg
+     * @deprecated use {@link RaycastBVHVisitor} instead
+     */
+    traverseRayLeafIntersections(startX, startY, startZ, directionX, directionY, directionZ, visitor, thisArg) {
+        this.traversePreOrderUsingStack(function (node) {
+            let b = node.intersectRay(startX, startY, startZ, directionX, directionY, directionZ);
 
-/**
- *
- * @param {LeafNode[]} result destination
- * @param {number} x0
- * @param {number} y0
- * @param {number} z0
- * @param {number} x1
- * @param {number} y1
- * @param {number} z1
- * @returns {number} number of objects added to the result
- */
-BinaryNode.prototype.requestLeafIntersectionsAABB3 = function (result, x0, y0, z0, x1, y1, z1) {
-    const startOffset = stackPointer;
+            if (!b) {
+                //no intersection, terminate this branch
+                return false;
+            }
 
-    stack[stackPointer++] = this;
+            if (isLeaf(node)) {
+                //leaf node, supply to visitor
+                visitor.call(thisArg, node);
+                return false;
+            } else {
+                //intermediate node, continue traversal
+                return true;
+            }
+        });
+    }
 
-    let count = 0;
+    /**
+     * Fraction of balanced nodes in the tree (those that have both children)
+     * @returns {number}
+     */
+    computeBalanceFactor() {
 
-    while (stackPointer > startOffset) {
-        stackPointer--;
-        const node = stack[stackPointer];
+        const bvhVisitor = new BVHVisitor();
 
-        if (!aabb3_intersect_aabb3(
-            x0, y0, z0, x1, y1, z1,
-            node.x0, node.y0, node.z0, node.x1, node.y1, node.z1
-        )) {
-            //no overlap
-            continue;
-        }
 
-        if (node.isLeafNode) {
-            result[count++] = node;
+        const depths = [];
 
-            count++;
-        } else {
-            const left = node.left;
-            if (left !== null) {
-                stack[stackPointer++] = left;
-            }
+        bvhVisitor.visitLeaf = (leaf) => {
+            const depth = leaf.computeDepth();
 
-            const right = node.right;
-            if (right !== null) {
-                stack[stackPointer++] = right;
-            }
-        }
-    }
+            depths.push(depth);
+        };
 
-    return count;
-};
+        traverseBinaryNodeUsingVisitor(this, bvhVisitor)
 
-BinaryNode.prototype.traverseSegmentLeafIntersections = function (startX, startY, startZ, endX, endY, endZ, visitor) {
-    this.traversePreOrder(function (node) {
-        let b = node.intersectSegment(startX, startY, startZ, endX, endY, endZ);
-        if (!b) {
-            return false;
-        }
-        if (node instanceof LeafNode) {
-            visitor(node);
-            return false;
+        if (depths.length === 0) {
+            return 1;
         } else {
-            return true;
+            return computeSampleStandardDeviation(depths);
         }
-    });
-};
 
-/**
- * @private
- * Used in intersection traversal methods. Should be invoked via Function.apply and Function.call only and not be called directly
- * @param {LeafNode} node
- */
-function fastVisitLeafNodeIntersection(node) {
-    this(node, true);
-}
+    }
 
-/**
- *
- * @param {Frustum[]} frustums Collection of THREE.js Frustums
- * @param {function(node:LeafNode, boolean)} visitor
- * @returns {number}
- * @deprecated Use {@link ThreeFrustumsIntersectionBVHVisitor}
- */
-BinaryNode.prototype.threeTraverseFrustumsIntersections = function (frustums, visitor) {
-    const numFrustums = frustums.length;
+    /**
+     * @template T
+     * @param {number} x0
+     * @param {number} y0
+     * @param {number} z0
+     * @param {number} x1
+     * @param {number} y1
+     * @param {number} z1
+     * @param {T} value
+     * @returns {LeafNode}
+     */
+    insert(x0, y0, z0, x1, y1, z1, value) {
+        const leaf = new LeafNode(value, x0, y0, z0, x1, y1, z1);
+        this.insertNode(leaf);
+        return leaf;
+    }
 
     /**
      *
-     * @param {LeafNode|BinaryNode} node
-     * @returns {boolean}
+     * @param {Node|BinaryNode|LeafNode} child
      */
-    function visitNode(node) {
-        let b = false;
-        let i = 0;
+    insertNode(child) {
 
-        for (; i < numFrustums; i++) {
+        assert.notNull(child, "child");
+        assert.defined(child, "child");
+        assert.isInstanceOf(child, Node, 'child', "Node");
+        assert.equal(child.parentNode, null, "parentNode must be null, otherwise Node still belongs to another tree");
 
-            const degree = node.intersectFrustumDegree(frustums[i]);
+        const sibling = this.__insertion_findSiblingFor(child);
 
-            if (degree === 2) {
-                //completely inside frustum
+        const sibling_parent = sibling.parentNode;
+        let parent = sibling_parent;
 
-                if (node.isLeafNode) {
-                    visitor(node, true);
-                } else {
-                    node.traverseLeavesPreOrderUsingStack(fastVisitLeafNodeIntersection, visitor);
-                }
-
-                //prevent further traversal
-                return false;
+        if (sibling_parent === null) {
+            // "sibling" is the root node
 
-            } else if (degree === 1) {
+            parent = sibling;
 
-                //partially inside frustum
-                b = true;
+            if (sibling.left === null) {
+                sibling.setChildLeft(child);
+            } else if (sibling.right === null) {
+                sibling.setChildRight(child);
+            } else {
+                parent = new BinaryNode();
 
+                parent.setChildren(sibling.right, child);
+                sibling.right = parent;
+                parent.parentNode = sibling;
             }
-        }
 
-        if (!b) {
-            return false;
-        }
+        } else {
 
-        if (node.isLeafNode) {
-            visitor(node, false);
-        }
+            // non-root
 
-        return true;
-    }
+            if (sibling_parent.left === sibling && sibling_parent.right === null) {
 
-    return this.traversePreOrderUsingStack(visitNode);
-};
+                // right node is free, take it
+                sibling_parent.setChildRight(child);
 
-/**
- * As recursion goes on, we remove frustums and planes from checks reducing total number of checks necessary
- * @param {Array.<THREE.Frustum>} frustums
- * @param {function} visitor
- * @returns {number}
- */
-BinaryNode.prototype.threeTraverseFrustumsIntersections2 = function (frustums, visitor) {
-    const numFrustums = frustums.length;
+            } else if (sibling_parent.right === sibling && sibling_parent.left === null) {
 
-    function visitLeaves(node) {
-        if (node instanceof LeafNode) {
-            visitor(node);
-            return false;
-        } else {
-            return true;
-        }
-    }
+                // left node is free, take it
+                sibling_parent.setChildLeft(child);
+
+            } else {
+
+                parent = transplantNewCommonParent(sibling, child)
+
+            }
 
-    function fastTraverseLeaves(node) {
-        if (node instanceof LeafNode) {
-            visitor(node);
-        } else {
-            node.traversePreOrderUsingStack(visitLeaves);
         }
-    }
 
+        // walk back up the tree fixing heights and bounds
+        while (parent !== null) {
+            // parent = this.balance();
 
-    function isFlagSet(mask, index) {
-        return mask & (1 << index) !== 0;
-    }
+            const left = parent.left;
+            const right = parent.right;
 
-    function clearFlag(mask, index) {
-        return mask & ~(1 << index);
-    }
+            parent.height = 1 + max2(left !== null ? left.height : 0, right !== null ? right.height : 0);
+            parent.refit();
 
-    function removeElementFromClone(original, clone, mask, originalIndex) {
-        if (clone === original) {
-            //clone planes
-            clone = clone.slice();
+            parent = parent.parentNode;
         }
-        //remove the plane from new set
-        clone.splice(originalIndex, 1);
-        return clone;
     }
 
-    function processVolumesIntersections(node, planeSets, planeSetCount) {
-        let newPlaneSets = planeSets;
-        for (let iPS = planeSetCount - 1; iPS >= 0; iPS--) {
-
-            const planes = planeSets[iPS];
-            let newPlanes = planes;
-            const numPlanes = planes.length;
-
-            //check plane set
-            for (let i = numPlanes - 1; i >= 0; i--) {
-                const plane = planes[i];
-                const planeSide = node.computePlaneSide(plane);
-                if (planeSide < 0) {
-                    //completely inside
-                    newPlanes = removeElementFromClone(planes, newPlanes, i);
-                } else if (planeSide > 0) {
-                    //on the wrong side of the plane
-                    //drop plane set
-                    newPlaneSets = removeElementFromClone(planeSets, newPlaneSets, iPS);
-
-                    break;
-                }
-            }
+    /**
+     * @param {boolean} deep
+     * @returns {BinaryNode}
+     */
+    clone(deep = false) {
+        const clone = new BinaryNode();
 
-            //update plane sets as needed
-            if (newPlanes !== planes && newPlaneSets.indexOf(planes) !== -1) {
-                //replace
-                if (newPlaneSets === planeSets) {
-                    //clone if needed
-                    newPlaneSets = newPlaneSets.slice();
-                }
-                newPlaneSets[iPS] = newPlanes;
-            }
-        }
+        clone.x0 = this.x0;
+        clone.y0 = this.y0;
+        clone.z0 = this.z0;
+        clone.x1 = this.x1;
+        clone.y1 = this.y1;
+        clone.z1 = this.z1;
 
-        return newPlaneSets;
-    }
+        clone.leafNodeCount = this.leafNodeCount;
 
-    function traverseVolumeIntersections(node, planeSets, numPlaneSets) {
-        function internalVisitor(node) {
-            let newPlaneSet = processVolumesIntersections(node, planeSets, numPlaneSets);
-            if (newPlaneSet !== planeSets) {
-                let newPlaneSetCount = newPlaneSet.length;
-                if (newPlaneSetCount !== 0) {
-                    //some intersections
-
-                    //check if all plane sets are trivial (contain no test planes)
-                    let trivialPlaneSets = 0;
-                    for (let i = 0; i < newPlaneSetCount; i++) {
-                        if (newPlaneSet[i].length === 0) {
-                            trivialPlaneSets++;
-                        }
-                    }
+        clone.parentNode = this.parentNode;
 
-                    if (isLeaf(node)) {
-                        visitor(node);
-                    } else {
-                        if (trivialPlaneSets === newPlaneSetCount) {
-                            fastTraverseLeaves(node);
-                        } else {
-                            traverseVolumeIntersections(node, newPlaneSet, newPlaneSetCount);
-                        }
-                    }
-                }
-            } else {
-                if (isLeaf(node)) {
-                    visitor(node);
-                } else {
-                    return true;
-                }
+        if (deep === true) {
+            if (this.left !== null) {
+                clone.left = this.left.clone(true);
+                clone.left.parentNode = clone;
             }
-
-            return false;
+            if (this.right !== null) {
+                clone.right = this.right.clone(true);
+                clone.right.parentNode = clone;
+            }
+        } else {
+            clone.left = this.left;
+            clone.right = this.right;
         }
 
-        node.traversePreOrderUsingStack(internalVisitor);
-    }
+        clone.modifiers = this.modifiers;
 
-    function startTraversal(node) {
-        let planeSets = [];
-        for (let i = 0; i < numFrustums; i++) {
-            const frustum = frustums[i];
-            const planes = frustum.planes;
-            planeSets.push(planes);
-        }
-        traverseVolumeIntersections(node, planeSets, numFrustums);
+        return clone;
     }
-
-    startTraversal(this);
-};
+}
 
 /**
- *
- * @param {number} startX
- * @param {number} startY
- * @param {number} startZ
- * @param {number} directionX
- * @param {number} directionY
- * @param {number} directionZ
- * @param {function(node:LeafNode)} visitor
- * @param thisArg
- * @deprecated use {@link RaycastBVHVisitor} instead
+ * @readonly
+ * @type {boolean}
  */
-BinaryNode.prototype.traverseRayLeafIntersections = function (startX, startY, startZ, directionX, directionY, directionZ, visitor, thisArg) {
-    this.traversePreOrderUsingStack(function (node) {
-        let b = node.intersectRay(startX, startY, startZ, directionX, directionY, directionZ);
-
-        if (!b) {
-            //no intersection, terminate this branch
-            return false;
-        }
-
-        if (isLeaf(node)) {
-            //leaf node, supply to visitor
-            visitor.call(thisArg, node);
-            return false;
-        } else {
-            //intermediate node, continue traversal
-            return true;
-        }
-    });
-};
+BinaryNode.prototype.isBinaryNode = true;
 
 /**
- * Fraction of balanced nodes in the tree (those that have both children)
+ * @see "Dynamic BVH" by Erin Catto / Blizzard
+ * @param {AABB3} node
+ * @param {AABB3} addition
  * @returns {number}
  */
-BinaryNode.prototype.computeBalanceFactor = function () {
-
-    const bvhVisitor = new BVHVisitor();
+function inclusion_surface_area_heuristic(node, addition) {
+    const x0 = min2(node.x0, addition.x0);
+    const y0 = min2(node.y0, addition.y0);
+    const z0 = min2(node.z0, addition.z0);
 
+    const x1 = max2(node.x1, addition.x1);
+    const y1 = max2(node.y1, addition.y1);
+    const z1 = max2(node.z1, addition.z1);
 
-    const depths = [];
+    return _boxSurfaceArea2(x0, y0, z0, x1, y1, z1) - boxSurfaceArea2(node);
+}
 
-    bvhVisitor.visitLeaf = (leaf) => {
-        const depth = leaf.computeDepth();
+/**
+ *
+ * @param {BinaryNode|LeafNode} node
+ * @param {AABB3} addition
+ */
+function inclusion_cost_lower_bound(node, addition) {
+    let n = node;
+    let r = boxSurfaceArea2(addition);
 
-        depths.push(depth);
-    };
+    while (n !== null) {
 
-    traverseBinaryNodeUsingVisitor(this, bvhVisitor)
+        r += n.costForInclusion(addition);
 
-    if (depths.length === 0) {
-        return 1;
-    } else {
-        return computeSampleStandardDeviation(depths);
+        n = n.parentNode;
     }
 
-};
+    return r;
+}
+
 
 /**
- * @template T
- * @param {number} x0
- * @param {number} y0
- * @param {number} z0
- * @param {number} x1
- * @param {number} y1
- * @param {number} z1
- * @param {T} value
- * @returns {LeafNode}
+ * @private
+ * Used in intersection traversal methods. Should be invoked via Function.apply and Function.call only and not be called directly
+ * @param {LeafNode} node
  */
-BinaryNode.prototype.insert = function (x0, y0, z0, x1, y1, z1, value) {
-    const leaf = new LeafNode(value, x0, y0, z0, x1, y1, z1);
-    this.insertNode(leaf);
-    return leaf;
-};
+function fastVisitLeafNodeIntersection(node) {
+    this(node, true);
+}
 
 /**
  *
@@ -1188,105 +1194,6 @@ function transplantNewCommonParent(node, child) {
     bNode.setChildren(node, child);
     bNode.parentNode = parent;
 
-    parent.bubbleExpandToFit(bNode);
-
-    parent.updateLeafNodeCount();
-
     return bNode;
 }
 
-/**
- *
- * @param {Node|BinaryNode|LeafNode} child
- */
-BinaryNode.prototype.insertNode = function (child) {
-
-    assert.notNull(child, "child");
-    assert.defined(child, "child");
-    assert.isInstanceOf(child, Node, 'child', "Node");
-    assert.equal(child.parentNode, null, "parentNode must be null, otherwise Node still belongs to another tree");
-
-    const sibling = this.__insertion_findSiblingFor(child);
-
-    const sibling_parent = sibling.parentNode;
-    if (sibling_parent === null) {
-        // root node
-
-        if (sibling.left === null) {
-            sibling.setChildLeft(child);
-        } else if (sibling.right === null) {
-            sibling.setChildRight(child);
-        } else {
-            const parent = new BinaryNode();
-
-            parent.setChildren(sibling.right, child);
-            sibling.right = parent;
-            parent.parentNode = sibling;
-        }
-
-    } else {
-
-        // non-root
-
-        if (sibling_parent.left === sibling && sibling_parent.right === null) {
-
-            // right node is free, take it
-            sibling_parent.setChildRight(child);
-
-        } else if (sibling_parent.right === sibling && sibling_parent.left === null) {
-
-            // left node is free, take it
-            sibling_parent.setChildLeft(child);
-
-        } else {
-
-            transplantNewCommonParent(sibling, child)
-
-        }
-
-        sibling_parent.bubbleRefit();
-
-    }
-}
-
-/**
- * @param {boolean} deep
- * @returns {BinaryNode}
- */
-BinaryNode.prototype.clone = function (deep = false) {
-    const clone = new BinaryNode();
-
-    clone.x0 = this.x0;
-    clone.y0 = this.y0;
-    clone.z0 = this.z0;
-    clone.x1 = this.x1;
-    clone.y1 = this.y1;
-    clone.z1 = this.z1;
-
-    clone.leafNodeCount = this.leafNodeCount;
-
-    clone.parentNode = this.parentNode;
-
-    if (deep === true) {
-        if (this.left !== null) {
-            clone.left = this.left.clone(true);
-            clone.left.parentNode = clone;
-        }
-        if (this.right !== null) {
-            clone.right = this.right.clone(true);
-            clone.right.parentNode = clone;
-        }
-    } else {
-        clone.left = this.left;
-        clone.right = this.right;
-    }
-
-    clone.modifiers = this.modifiers;
-
-    return clone;
-};
-
-
-export {
-    BinaryNode
-};