ClipperMinkowski
clipper.ClipperMinkowski (Class)
Minkowski Sum and Difference operations.
Minkowski Sum: For each point P in path, the pattern is translated by P.
The union of all these translated patterns forms the Minkowski sum.
Minkowski Difference: Similar to sum, but subtracts pattern points from path points.
Static Members
Returns true if the polygon has a positive (counter-clockwise) winding.
Returns a reversed copy of the path.
Computes the Minkowski Sum of pattern and path.
| Name |
Type |
Description |
pattern |
Path64 |
The pattern polygon to add |
path |
Path64 |
The path polygon |
isClosed |
Bool |
Whether the path is closed |
| Returns |
Description |
| Paths64 |
The union of all translated patterns |
Computes the Minkowski Difference of pattern and path.
| Name |
Type |
Description |
pattern |
Path64 |
The pattern polygon to subtract |
path |
Path64 |
The path polygon |
isClosed |
Bool |
Whether the path is closed |
| Returns |
Description |
| Paths64 |
The union of all translated patterns |
Computes the Minkowski Sum for floating-point paths.
| Name |
Type |
Default |
Description |
pattern |
PathD |
|
The pattern polygon to add |
path |
PathD |
|
The path polygon |
isClosed |
Bool |
|
Whether the path is closed |
decimalPlaces |
Int |
2 |
Decimal precision for scaling (default 2) |
| Returns |
Description |
| PathsD |
The union of all translated patterns |
Computes the Minkowski Difference for floating-point paths.
| Name |
Type |
Default |
Description |
pattern |
PathD |
|
The pattern polygon to subtract |
path |
PathD |
|
The path polygon |
isClosed |
Bool |
|
Whether the path is closed |
decimalPlaces |
Int |
2 |
Decimal precision for scaling (default 2) |
| Returns |
Description |
| PathsD |
The union of all translated patterns |
Private Members
Internal implementation of Minkowski operation.
Creates quads from adjacent pattern/path point pairs.
Scales a PathD to Path64 by multiplying coordinates by scale.
Scales Paths64 to PathsD by multiplying coordinates by scale.
Performs a union operation on the given paths.