The component is used too locate the minimum distance between two polygons

This tool computes the smallest distance between two polygons or paths.
A path is an open polygon. The algorithm assumes that the shortest distance is
found either between a point from each polygon or between a point in one
polygon and an edge in the other.

NOTE1: The ROI should be set to "whole image". The image is ignored.
Setting the ROI will cause unneccesary processing and increased execution
time.

NOTE2: If the two polygons intersect, the algorithm will in general not compute
the correct intersection point and will not get a distance of zero. This is
because, as explained above, the smalles distance is always found between a
point and an edge, whereas in this case the correct shortest distance may be
between two intersecting edges. Note however, that if a polygon is only self-
intersecting the algorithm will work correctly.

Setup