distance_rr_min_dildistance_rr_min_dilDistanceRrMinDilDistanceRrMinDil (Operator)

Name

distance_rr_min_dildistance_rr_min_dilDistanceRrMinDilDistanceRrMinDil — Minimum distance between two regions with the help of dilation.

Signature

Description

The operator distance_rr_min_dildistance_rr_min_dilDistanceRrMinDilDistanceRrMinDilDistanceRrMinDil calculates the minimum distance between pairs of regions, by iteratively applying dilations on both regions until their intersection is non empty. If several regions are passed in Regions1Regions1Regions1Regions1regions1 and Regions2Regions2Regions2Regions2regions2 the distance between the i-th elements in each case is calculated. It then forms the i-th entry in the output parameter MinDistanceMinDistanceMinDistanceMinDistanceminDistance. The calculation is carried out with the help of dilation with the Golay element 'h'. The result is:

               Number of iterations * 2 - 1.

Attention

Both parameters must contain the same number of regions. The regions must not be empty.

Execution Information

• Multithreading type: reentrant (runs in parallel with non-exclusive operators).
• Multithreading scope: global (may be called from any thread).
• Automatically parallelized on tuple level.

Parameters

Result

The operator distance_rr_min_dildistance_rr_min_dilDistanceRrMinDilDistanceRrMinDilDistanceRrMinDil returns the value 2 (H_MSG_TRUE) if the input is not empty. Otherwise an exception is raised.

Possible Predecessors

thresholdthresholdThresholdThresholdThreshold, regiongrowingregiongrowingRegiongrowingRegiongrowingRegiongrowing, connectionconnectionConnectionConnectionConnection

Alternatives

distance_rr_mindistance_rr_minDistanceRrMinDistanceRrMinDistanceRrMin, dilation1dilation1Dilation1Dilation1Dilation1, intersectionintersectionIntersectionIntersectionIntersection

Module

Foundation