Method split

src/utils/rTree.ts:369–390

* Splits this node by creating two new nodes and dividing the this node's * children between them. This node is removed from its parent and the two * new nodes are added. * * If this node is the root, a new parent node is created. * * Returns the parent node.

(strategy: IRTreeSplitStrategy)

     * Returns the parent node.
     */
    public split(strategy: IRTreeSplitStrategy): RTreeNode<T> {
        // Remove self from parent.
        if (this.parent != null) {
            this.parent.remove(this);
        }

        // Create children from split
        const children: NodePair<T> = [
            new RTreeNode<T>(this.leaf),
            new RTreeNode<T>(this.leaf),
        ];
        strategy.split(this.entries, children);

        // Add new nodes to parent
        // If root, create new non-leaf node as parent.
        const parent = this.parent != null ? this.parent : new RTreeNode<T>(false);
        parent.insert(children[0]);
        parent.insert(children[1]);
        // Always make the parent a non-leaf after split
        parent.leaf = false;
        return parent;
    }

    /**
     * Returns the difference in area that adding an entry `bounds` to the node