@Override
	protected void checkNodeIntegrity(NR n) {
		super.checkNodeIntegrity(n);
		if (n.getChildCount() > maxChildren) {
			throw new AssertionError("Node exceeds the maximum children");
		}
	}
Now that the heap is sized "reinsertCount", after each new entry, I can remove the
nearest, knowing it can't possibly be selected for reinsertion. In the meantime, since I
know each removed entry will remain in its parent, I can compute the new bounds of the
parent.
Ghidra/Debug/ProposedUtils/src/main/java/ghidra/util/database/spatial/AbstractRStarConstraintsTree.java