|Constructor and Description|
|Modifier and Type||Method and Description|
Computes the maximum distance between the points defining two envelopes.
Computes the Min-Max Distance between two
env1- an envelope
env2- an envelope
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
However, little performance improvement is observed in practice.
a- an envelope
b- an envelope
Copyright © 2020. All rights reserved.