Minkowski Operations in Geometry

• Minkowski operations are fundamental set operations defined on convex bodies and polytopes, preserving convexity and exhibiting properties like GL(n)-covariance and associativity.
• They provide analytic frameworks using support functions and efficient algorithms in computational geometry for tasks such as collision detection and obstacle modeling.
• Generalizations, including Orlicz-Brunn–Minkowski theory and M-addition, extend classical operations, enabling robust variational analysis and real-time applications in control theory.

Minkowski operations are fundamental set-valued operations—primarily sum and difference—defined on geometric objects such as convex bodies, polytopes, and more general sets in finite-dimensional real vector spaces. These operations underpin a vast body of convex geometry, computational geometry, variational analysis, mathematical morphology, and control theory, providing analytic and algorithmic frameworks for set addition, configuration-space obstacle modeling, separation, and distance computations.

1. Core Definitions and Algebraic Framework

Let $A, B \subset \mathbb{R}^n$ be nonempty sets. The Minkowski sum is given by

$A + B = \{ a + b : a \in A,\, b \in B \},$

and the Minkowski difference (in the classic vector-subtraction sense) is

$A - B = \{ a - b : a \in A,\, b \in B \}.$

Within convex geometry, Minkowski addition preserves convexity: if $A$ and $B$ are convex, so is $A+B$ (Gardner et al., 2012). Similarly, $A-B$ is convex if $A$ and $B$ are convex. Minkowski operations are also central in the definition of other operators, such as the difference body $K+(-K)$ for a convex body $A + B = \{ a + b : a \in A,\, b \in B \},$0.

An alternative “containment” version of the Minkowski difference is

$A + B = \{ a + b : a \in A,\, b \in B \},$1

important in localization and reachability analysis (Desrochers et al., 2017).

Minkowski addition is characterized by continuity in the Hausdorff metric, $A + B = \{ a + b : a \in A,\, b \in B \},$2-covariance, associativity, and the identity property: it is the unique continuous, $A + B = \{ a + b : a \in A,\, b \in B \},$3-covariant, identity-having binary operation on compact convex sets, with polynomial volume property (Gardner et al., 2012).

2. Fundamental Properties and Variational Structure

Minkowski addition admits an analytic description via support functions: $A + B = \{ a + b : a \in A,\, b \in B \},$4 where $A + B = \{ a + b : a \in A,\, b \in B \},$5 (Gardner et al., 2012). This property is the cornerstone of the Brunn–Minkowski theory, where the volume polynomiality

$A + B = \{ a + b : a \in A,\, b \in B \},$6

is homogeneous of degree $A + B = \{ a + b : a \in A,\, b \in B \},$7 in $A + B = \{ a + b : a \in A,\, b \in B \},$8.

On origin-symmetric convex bodies, essentially every continuous, $A + B = \{ a + b : a \in A,\, b \in B \},$9-covariant, associative operation with polynomial volume is either Minkowski addition or one of three trivial operations (Gardner et al., 2012). The difference body operator $A - B = \{ a - b : a \in A,\, b \in B \}.$0 is the central, symmetric Minkowski additive operator.

Generalizations include M-addition: for a set $A - B = \{ a - b : a \in A,\, b \in B \}.$1,

$A - B = \{ a - b : a \in A,\, b \in B \}.$2

which recovers Minkowski addition as the case $A - B = \{ a - b : a \in A,\, b \in B \}.$3 (Gardner et al., 2012).

3. Representations for Convex Polytopes and Zonotopes

Closed-form Minkowski operations exist in both H-representation (half-spaces) and V-representation (vertices):

• V-rep sums/differences: For $A - B = \{ a - b : a \in A,\, b \in B \}.$4, $A - B = \{ a - b : a \in A,\, b \in B \}.$5,

$A - B = \{ a - b : a \in A,\, b \in B \}.$6

• H-rep minus V-rep: For $A - B = \{ a - b : a \in A,\, b \in B \}.$7, $A - B = \{ a - b : a \in A,\, b \in B \}.$8,

$A - B = \{ a - b : a \in A,\, b \in B \}.$9

• H-rep minus H-rep: For $A$0, $A$1,

$A$2

These results are dimension-independent and enable reductions of separation, distance, and feasibility queries to equivalent problems over $A$3 (Gabidullina, 2019).

For zonotopes (centrally symmetric polytopes expressible as sums of segments), the Minkowski sum is closed under generator representation, but the difference is not closed above dimension two. Efficient H-representation algorithms exist, which build the intersection of the minuend’s facets with translated copies by each subtrahend generator. Under- and over-approximate generator-space algorithms use LP contraction techniques to ensure containment (Althoff, 2015).

Representation	Sum	Difference (Classic)
V-rep	$A$4	$A$5
H-rep	Combine halfspaces	See constraint-shift/augmentation
Zonotope (G-rep)	Concatenate generators	Not closed; use H-rep or approximations

4. Minkowski Operations in Generalized and Orlicz-Brunn–Minkowski Theory

Minkowski operations extend to generalized Minkowski spaces and non-linear (Orlicz) settings. In a generalized Minkowski space $A$6, where $A$7 is the gauge of a convex set $A$8, notions of minimal containment, circumradius, ball-hulls, and successive radii $A$9 and $B$0 are developed via Minkowski sums with flats and homothets (Jahn, 2014). These underpin Chebyshev-center problems, incenter sets, diametrical completeness, and constant width criteria.

In the dual Orlicz-Brunn–Minkowski theory, Minkowski-type operations are generalized by replacing $B$1 with Orlicz linear/radial combinations defined via support or radial functions, and the associated volume is prescribed by a flexible $B$2 weighting. Corresponding variational formulas and curvature measures lead to new classes of Minkowski problems and inequalities (Gardner et al., 2018), including dual Orlicz-Minkowski inequalities and radial Orlicz sums.

5. Volume Constraints, Additive Operators, and Rigidity

Abardia, Colesanti, and Saorín Gómez established strong rigidity results for Minkowski additive, continuous, translation-invariant operators $B$3 under uniform volume constraints. If $B$4 is monotone or $B$5-equivariant and satisfies

$B$6

then up to nonsingular linear maps, $B$7 collapses to the difference body operator $B$8, or its symmetrized versions (Abardia-Evéquoz et al., 2017). More precisely:

• In the monotone case, $B$9 for $A+B$0.
• For $A+B$1-equivariance, $A+B$2 takes the form

$A+B$3

where $A+B$4 is the Steiner point.

Thus, classical affine isoperimetric-type inequalities bound the action of all volume-constrained Minkowski additive operators to the affine orbit of the difference body, with the Rogers–Shephard bounds becoming canonical (Abardia-Evéquoz et al., 2017).

6. Algorithmic Aspects in Computational Geometry and Robotics

Minkowski sums and differences are central to computational geometry, with robust, output-sensitive algorithms for 3D convex polyhedra based on Gaussian maps and arrangement data structures (0906.3240). Efficient overlay algorithms compute the sum of polytopes in $A+B$5, handling degenerate inputs exactly (e.g., via CGAL's Arrangement_on_surface_2).

Applications include collision detection (translate the problem to point membership in $A+B$6), assembly partitioning (analysis of motion-space by Minkowski operations in the dual spherical domain), and Boolean set operations (constructive solid geometry, lower/upper envelopes).

In robotics, Minkowski operations underpin state-of-the-art formulations for configuration-space obstacles and signed distance functions between polytopic sets, notably in the context of Control Barrier Functions (CBFs). Optimization-defined CBFs utilize the Minkowski difference in "MD-space," allowing both minimum distances (via QP) and penetration depths (via LP) to be computed precisely and differentiably with respect to system state, enabling real-time, non-conservative safety constraints (Chen et al., 1 Apr 2025). Similar techniques, including separator-based paving, are used for certified robot localization in unstructured environments (Desrochers et al., 2017).

7. Extensions and Practical Considerations

Applications of Minkowski operations are widespread:

• Linear separation and support vector machines: $A+B$7 (Gabidullina, 2019).
• Variational inequalities and set feasibility problems can be recast via Minkowski operations.
• Morphological image operators and reachability computations reduce to Minkowski sums/differences.
• For high-dimensional settings, especially with zonotopes, exact difference computation is feasible for low to moderate dimension, but tractable under- and over-approximation techniques are necessary for scalability (Althoff, 2015).

The Minkowski operations paradigm is further generalized in dual (star-set) theory, where radial addition replaces classic sum, and in the Orlicz-Brunn–Minkowski setting, which produces new inequalities and variational principles foundational for modern convex geometric analysis (Gardner et al., 2018).

---

Minkowski operations constitute the analytic, algebraic, and algorithmic infrastructure for a substantial segment of contemporary geometry, optimization, control theory, and computational methods. The rich structure, robust theory, and breadth of applications make them indispensable tools in the mathematical sciences.