Computes the Min-Max Distance between two
Envelopes. It is equal to the minimum of the maximum distances between all pairs of edge segments from the two envelopes. This is the tight upper bound on the distance between geometric items bounded by the envelopes.
Theoretically this bound can be used in the R-tree nearest-neighbour branch-and-bound search instead of maximumDistance(Envelope, Envelope). However, little performance improvement is observed in practice.
-
Parameters:
-
a - a an envelope
-
b - b an envelope
-
Returns:
-
the min-max-distance between the envelopes