Minimum distance between two regions with the help of dilatation.
The operator min_distance1 calculates the minimum distance between pairs of regions. If several regions are passed in Regions1 and Regions2 the distance between the i-th elements in each case is calculated. It then forms the i-th entry in the output parameter Distance. The calculation is carried out with the help of dilatation with the Golay element 'h'. The result is:
Number of iterations * 2 - 1.The mask 'h' has the effect that precisely the maximum metrics are calculated.
Both parameters must contain the same number of regions. The regions must not be empty.
Regions1 (input_object) |
region(-array) -> object |
Region to be examined. |
Regions2 (input_object) |
region(-array) -> object |
Region to be examined. |
Distance (output_control) |
integer(-array) -> integer |
Distances of the regions. | |
Assertion: -1 <= Distance |
The operator min_distance1 returns the value TRUE if the input is not empty. Otherwise an exception is raised.
threshold__, regiongrowing__, connection
min_distance2, dilation1, intersection