minkowski_add1minkowski_add1MinkowskiAdd1MinkowskiAdd1MinkowskiAdd1minkowski_add1 dilates the input regions with a
structuring element. By applying minkowski_add1minkowski_add1MinkowskiAdd1MinkowskiAdd1MinkowskiAdd1minkowski_add1 to a
region, its boundary gets smoothed. In the process, the area of the
region is enlarged. Furthermore, disconnected regions may be
merged. Such regions, however, remain logically distinct region.
The Minkowski addition is a set-theoretic region operation. It is
based on translations and union operations.
The parameter IterationsIterationsIterationsIterationsiterationsiterations determines the number of
iterations which are to be performed with the structuring element.
The result of iteration n-1 is used as input for iteration n.
From the above definition it follows that an empty region is
generated in case of an empty structuring element.
A Minkowski addition always results in enlarged regions.
Closely spaced regions which may touch or overlap as a result of the
dilation are still treated as two separate regions. If the desired
behavior is to merge them into one region, the operator
union1union1Union1Union1Union1union1 has to be called first.
Execution Information
Multithreading type: reentrant (runs in parallel with non-exclusive operators).
Multithreading scope: global (may be called from any thread).
Typical range of values: 1
≤
IterationsIterationsIterationsIterationsiterationsiterations (lin)
Minimum increment: 1
Recommended increment: 1
Complexity
Let F1 be the area of the input region, and F2 be the area of
the structuring element. Then the runtime complexity for one region
is:
Result
minkowski_add1minkowski_add1MinkowskiAdd1MinkowskiAdd1MinkowskiAdd1minkowski_add1 returns TRUE if all parameters are
correct. The behavior in case of empty or no input region can be
set via: