protected double computeOverlap(NS n, Iterable<NR> all, NR ignore) {
		double sum = 0;
		for (NR r : all) {
			if (r == ignore) {
				ignore = null;
				continue;
			}
			sum += n.computeAreaIntersection(r.getShape());
		}
		assert ignore == null;
		return sum;
	}
Computes the overlap of a bounding shape (with respect to its siblings)

<p>
This measure is defined in Section 4.1 of the paper.

@param n the shape to measure
@param all the sibling nodes (may contain {@code n}, which is ignored)
@param ignore the node whose shape is being considered
@return the overlap measure
Ghidra/Debug/ProposedUtils/src/main/java/ghidra/util/database/spatial/AbstractRStarConstraintsTree.java