distance_rr_min

Herror ::distance_rr_min_dil ( Hobject Regions1, Hobject Regions2, long *MinDistance ) Herror ::distance_rr_min_dil ( Hobject Regions1, Hobject Regions2, HTuple *MinDistance ) long HRegion::DistanceRrMinDil ( const HRegionArray &Regions2 ) const HTuple HRegionArray::DistanceRrMinDil ( const HRegionArray &Regions2 ) const

Minimum distance between two regions with the help of dilatation.

The operator ::distance_rr_min_dil 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 MinDistance. 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.

Attention

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

Parameters

`Regions1` (input_object)	region(-array) `->` Hobject: HRegion(Array)
Regions to be examined.

`Regions2` (input_object)	region(-array) `->` Hobject: HRegion(Array)
Regions to be examined.

`MinDistance` (output_control)	integer(-array) `->` (HTuple.) long *
Minimum distances of the regions.
Assertion: `-1 <= MinDistance`

Result

The operator ::distance_rr_min_dil returns the value H_MSG_TRUE if the input is not empty. Otherwise an exception handling is raised.

Possible Predecessors

::threshold, ::regiongrowing, ::connection

Alternatives

::distance_rr_min, ::dilation1, ::intersection

Module

Region processing