Skip to content

distance_rr_min_dildistance_rr_min_dilDistanceRrMinDilDistanceRrMinDildistance_rr_min_dildistance_rr_min_dil🔗

Short description🔗

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

Signature🔗

distance_rr_min_dil( region Regions1, region Regions2, out integer MinDistance )distance_rr_min_dil( Regions1, Regions2 : : : MinDistance )void DistanceRrMinDil( const HObject& Regions1, const HObject& Regions2, HTuple* MinDistance )static void HOperatorSet.DistanceRrMinDil( HObject regions1, HObject regions2, out HTuple minDistance )def distance_rr_min_dil( regions_1: HObject, regions_2: HObject ) -> Sequence[int]

def distance_rr_min_dil_s( regions_1: HObject, regions_2: HObject ) -> intHerror distance_rr_min_dil( const Hobject Regions1, const Hobject Regions2, Hlong* MinDistance )

Herror T_distance_rr_min_dil( const Hobject Regions1, const Hobject Regions2, Htuple* MinDistance )

HTuple HRegion::DistanceRrMinDil( const HRegion& Regions2 ) const

HTuple HRegion.DistanceRrMinDil( HRegion regions2 )

Description🔗

The operator distance_rr_min_dilDistanceRrMinDil 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 Regions1regions1regions_1 and Regions2regions2regions_2 the distance between the i-th elements in each case is calculated. It then forms the i-th entry in the output parameter MinDistanceminDistancemin_distance. The calculation is carried out with the help of dilation with the Golay element ‘h’ (see dilation_golayDilationGolay for further information). The result is: \(n_{i} * 2 - 1\) where \(n_{i}\) is the number of iterations. The mask ‘h’ has the effect that precisely the maximum metrics are calculated.

Attention🔗

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

Execution information🔗

Execution information
  • Multithreading type: reentrant (runs in parallel with non-exclusive operators).

  • Multithreading scope: global (may be called from any thread).

Parameters🔗

Regions1regions1regions_1 (input_object) region(-array) → objectobjectHObjectHRegionHObjectHobject

Regions to be examined.

Regions2regions2regions_2 (input_object) region(-array) → objectobjectHObjectHRegionHObjectHobject

Regions to be examined.

MinDistanceminDistancemin_distance (output_control) integer(-array) → (integer)(integer)HTuple (Hlong)HTuple (int / long)Sequence[int]Htuple (Hlong)

Minimum distances of the regions.

Assertion: -1 <= MinDistance

Result🔗

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

Combinations with other operators🔗

Combinations

Possible predecessors

thresholdThreshold, regiongrowingRegiongrowing, connectionConnection

Alternatives

distance_rr_minDistanceRrMin, dilation1Dilation1, intersectionIntersection

Module🔗

Foundation