Method
Minkowski Sum
Geometric operation underlying No-Fit Polygon computation.
Also called: Minkowski Sum · 민코프스키 덧셈
Last verified: 2026-05-27
A geometry primitive: . In nesting it is the computational basis of the No-Fit Polygon — the NFP of two pieces is the Minkowski sum of one piece with the reflection of the other.
Claims & evidence
Every relationship is a claim with an equivalence level and an evidence grade. See the evidence policy.
| Relationship | Claim | Equiv. | Evidence | Sources |
|---|---|---|---|---|
| shares method withNo-Fit Polygon | The No-Fit Polygon of A and B equals the Minkowski sum of A and the reflection (−B); computing the NFP is computing a Minkowski sum. | E0 | A |
|
Neighborhood
Direct graph neighbors. Toggle depth to expand.
Click a node to open it · click an edge for its claim
See also
Not directly linked, but conceptually close — by the connections and descriptions they share.