private final boolean hasDuplicateLocation( final float[] objectEnvelope ) { for ( Entry<T> obj : leafObjects ) { float[] second = obj.entryEnv; double minD = calcDist( objectEnvelope, second, 0, maxOffset ); double maxD = calcDist( objectEnvelope, second, maxOffset, maxOffset ); // if min and max have distance 0, then just count as one because they are equals, this might // prevent a stack overflow if ( ( minD < SPLIT_CRITERIA_EPSILON && maxD < SPLIT_CRITERIA_EPSILON ) ) { return true; } } return false; }