- Source: Minkowski addition
In geometry, the Minkowski sum of two sets of position vectors A and B in Euclidean space is formed by adding each vector in A to each vector in B:
A
+
B
=
{
a
+
b
|
a
∈
A
,
b
∈
B
}
{\displaystyle A+B=\{\mathbf {a} +\mathbf {b} \,|\,\mathbf {a} \in A,\ \mathbf {b} \in B\}}
The Minkowski difference (also Minkowski subtraction, Minkowski decomposition, or geometric difference) is the corresponding inverse, where
(
A
−
B
)
{\displaystyle (A-B)}
produces a set that could be summed with B to recover A. This is defined as the complement of the Minkowski sum of the complement of A with the reflection of B about the origin.
−
B
=
{
−
b
|
b
∈
B
}
{\displaystyle -B=\{\mathbf {-b} \,|\,\mathbf {b} \in B\}}
A
−
B
=
(
A
∁
+
(
−
B
)
)
∁
{\displaystyle A-B=(A^{\complement }+(-B))^{\complement }}
This definition allows a symmetrical relationship between the Minkowski sum and difference. Note that alternately taking the sum and difference with B is not necessarily equivalent. The sum can fill gaps which the difference may not re-open, and the difference can erase small islands which the sum cannot recreate from nothing.
(
A
−
B
)
+
B
⊆
A
{\displaystyle (A-B)+B\subseteq A}
(
A
+
B
)
−
B
⊇
A
{\displaystyle (A+B)-B\supseteq A}
A
−
B
=
(
A
∁
+
(
−
B
)
)
∁
{\displaystyle A-B=(A^{\complement }+(-B))^{\complement }}
A
+
B
=
(
A
∁
−
(
−
B
)
)
∁
{\displaystyle A+B=(A^{\complement }-(-B))^{\complement }}
In 2D image processing the Minkowski sum and difference are known as dilation and erosion.
An alternative definition of the Minkowski difference is sometimes used for computing intersection of convex shapes. This is not equivalent to the previous definition, and is not an inverse of the sum operation. Instead it replaces the vector addition of the Minkowski sum with a vector subtraction. If the two convex shapes intersect, the resulting set will contain the origin.
A
−
B
=
{
a
−
b
|
a
∈
A
,
b
∈
B
}
=
A
+
(
−
B
)
{\displaystyle A-B=\{\mathbf {a} -\mathbf {b} \,|\,\mathbf {a} \in A,\ \mathbf {b} \in B\}=A+(-B)}
The concept is named for Hermann Minkowski.
Example
For example, if we have two sets A and B, each consisting of three position vectors (informally, three points), representing the vertices of two triangles in
R
2
{\displaystyle \mathbb {R} ^{2}}
, with coordinates
A
=
{
(
1
,
0
)
,
(
0
,
1
)
,
(
0
,
−
1
)
}
{\displaystyle A=\{(1,0),(0,1),(0,-1)\}}
and
B
=
{
(
0
,
0
)
,
(
1
,
1
)
,
(
1
,
−
1
)
}
{\displaystyle B=\{(0,0),(1,1),(1,-1)\}}
then their Minkowski sum is
A
+
B
=
{
(
1
,
0
)
,
(
2
,
1
)
,
(
2
,
−
1
)
,
(
0
,
1
)
,
(
1
,
2
)
,
(
1
,
0
)
,
(
0
,
−
1
)
,
(
1
,
0
)
,
(
1
,
−
2
)
}
,
{\displaystyle A+B=\{(1,0),(2,1),(2,-1),(0,1),(1,2),(1,0),(0,-1),(1,0),(1,-2)\},}
which comprises the vertices of a hexagon and its center .
For Minkowski addition, the zero set,
{
0
}
,
{\displaystyle \{0\},}
containing only the zero vector, 0, is an identity element: for every subset S of a vector space,
S
+
{
0
}
=
S
.
{\displaystyle S+\{0\}=S.}
The empty set is important in Minkowski addition, because the empty set annihilates every other subset: for every subset S of a vector space, its sum with the empty set is empty:
S
+
∅
=
∅
.
{\displaystyle S+\emptyset =\emptyset .}
For another example, consider the Minkowski sums of open or closed balls in the field
K
,
{\displaystyle \mathbb {K} ,}
which is either the real numbers
R
{\displaystyle \mathbb {R} }
or complex numbers
C
.
{\displaystyle \mathbb {C} .}
If
B
r
:=
{
s
∈
K
:
|
s
|
≤
r
}
{\displaystyle B_{r}:=\{s\in \mathbb {K} :|s|\leq r\}}
is the closed ball of radius
r
∈
[
0
,
∞
]
{\displaystyle r\in [0,\infty ]}
centered at
0
{\displaystyle 0}
in
K
{\displaystyle \mathbb {K} }
then for any
r
,
s
∈
[
0
,
∞
]
,
{\displaystyle r,s\in [0,\infty ],}
B
r
+
B
s
=
B
r
+
s
{\displaystyle B_{r}+B_{s}=B_{r+s}}
and also
c
B
r
=
B
|
c
|
r
{\displaystyle cB_{r}=B_{|c|r}}
will hold for any scalar
c
∈
K
{\displaystyle c\in \mathbb {K} }
such that the product
|
c
|
r
{\displaystyle |c|r}
is defined (which happens when
c
≠
0
{\displaystyle c\neq 0}
or
r
≠
∞
{\displaystyle r\neq \infty }
). If
r
,
s
,
{\displaystyle r,s,}
and
c
{\displaystyle c}
are all non-zero then the same equalities would still hold had
B
r
{\displaystyle B_{r}}
been defined to be the open ball, rather than the closed ball, centered at
0
{\displaystyle 0}
(the non-zero assumption is needed because the open ball of radius
0
{\displaystyle 0}
is the empty set). The Minkowski sum of a closed ball and an open ball is an open ball. More generally, the Minkowski sum of an open subset with any other set will be an open subset.
If
G
=
{
(
x
,
1
/
x
)
:
0
≠
x
∈
R
}
{\displaystyle G=\{(x,1/x):0\neq x\in \mathbb {R} \}}
is the graph of
f
(
x
)
=
1
x
{\displaystyle f(x)={\frac {1}{x}}}
and if and
Y
=
{
0
}
×
R
{\displaystyle Y=\{0\}\times \mathbb {R} }
is the
y
{\displaystyle y}
-axis in
X
=
R
2
{\displaystyle X=\mathbb {R} ^{2}}
then the Minkowski sum of these two closed subsets of the plane is the open set
G
+
Y
=
{
(
x
,
y
)
∈
R
2
:
x
≠
0
}
=
R
2
∖
Y
{\displaystyle G+Y=\{(x,y)\in \mathbb {R} ^{2}:x\neq 0\}=\mathbb {R} ^{2}\setminus Y}
consisting of everything other than the
y
{\displaystyle y}
-axis. This shows that the Minkowski sum of two closed sets is not necessarily a closed set. However, the Minkowski sum of two closed subsets will be a closed subset if at least one of these sets is also a compact subset.
Convex hulls of Minkowski sums
Minkowski addition behaves well with respect to the operation of taking convex hulls, as shown by the following proposition:
For all non-empty subsets
S
1
{\displaystyle S_{1}}
and
S
2
{\displaystyle S_{2}}
of a real vector space, the convex hull of their Minkowski sum is the Minkowski sum of their convex hulls:
Conv
(
S
1
+
S
2
)
=
Conv
(
S
1
)
+
Conv
(
S
2
)
.
{\displaystyle \operatorname {Conv} (S_{1}+S_{2})=\operatorname {Conv} (S_{1})+\operatorname {Conv} (S_{2}).}
This result holds more generally for any finite collection of non-empty sets:
Conv
(
∑
S
n
)
=
∑
Conv
(
S
n
)
.
{\textstyle \operatorname {Conv} \left(\sum {S_{n}}\right)=\sum \operatorname {Conv} (S_{n}).}
In mathematical terminology, the operations of Minkowski summation and of forming convex hulls are commuting operations.
If
S
{\displaystyle S}
is a convex set then
μ
S
+
λ
S
{\displaystyle \mu S+\lambda S}
is also a convex set; furthermore
μ
S
+
λ
S
=
(
μ
+
λ
)
S
{\displaystyle \mu S+\lambda S=(\mu +\lambda )S}
for every
μ
,
λ
≥
0
{\displaystyle \mu ,\lambda \geq 0}
. Conversely, if this "distributive property" holds for all non-negative real numbers,
μ
,
λ
{\displaystyle \mu ,\lambda }
, then the set is convex.
The figure to the right shows an example of a non-convex set for which
A
+
A
⊊
2
A
.
{\displaystyle A+A\subsetneq 2A.}
An example in
1
{\displaystyle 1}
dimension is:
B
=
[
1
,
2
]
∪
[
4
,
5
]
.
{\displaystyle B=[1,2]\cup [4,5].}
It can be easily calculated that
2
B
=
[
2
,
4
]
∪
[
8
,
10
]
{\displaystyle 2B=[2,4]\cup [8,10]}
but
B
+
B
=
[
2
,
4
]
∪
[
5
,
7
]
∪
[
8
,
10
]
,
{\displaystyle B+B=[2,4]\cup [5,7]\cup [8,10],}
hence again
B
+
B
⊊
2
B
.
{\displaystyle B+B\subsetneq 2B.}
Minkowski sums act linearly on the perimeter of two-dimensional convex bodies: the perimeter of the sum equals the sum of perimeters. Additionally, if
K
{\displaystyle K}
is (the interior of) a curve of constant width, then the Minkowski sum of
K
{\displaystyle K}
and of its
180
∘
{\displaystyle 180^{\circ }}
rotation is a disk. These two facts can be combined to give a short proof of Barbier's theorem on the perimeter of curves of constant width.
Applications
Minkowski addition plays a central role in mathematical morphology. It arises in the brush-and-stroke paradigm of 2D computer graphics (with various uses, notably by Donald E. Knuth in Metafont), and as the solid sweep operation of 3D computer graphics. It has also been shown to be closely connected to the Earth mover's distance, and by extension, optimal transport.
= Motion planning
=Minkowski sums are used in motion planning of an object among obstacles. They are used for the computation of the configuration space, which is the set of all admissible positions of the object. In the simple model of translational motion of an object in the plane, where the position of an object may be uniquely specified by the position of a fixed point of this object, the configuration space are the Minkowski sum of the set of obstacles and the movable object placed at the origin and rotated 180 degrees.
= Numerical control (NC) machining
=In numerical control machining, the programming of the NC tool exploits the fact that the Minkowski sum of the cutting piece with its trajectory gives the shape of the cut in the material.
= 3D solid modeling
=In OpenSCAD Minkowski sums are used to outline a shape with another shape creating a composite of both shapes.
= Aggregation theory
=Minkowski sums are also frequently used in aggregation theory when individual objects to be aggregated are characterized via sets.
= Collision detection
=Minkowski sums, specifically Minkowski differences, are often used alongside GJK algorithms to compute collision detection for convex hulls in physics engines.
Algorithms for computing Minkowski sums
= Planar case
=Two convex polygons in the plane
For two convex polygons P and Q in the plane with m and n vertices, their Minkowski sum is a convex polygon with at most m + n vertices and may be computed in time O(m + n) by a very simple procedure, which may be informally described as follows. Assume that the edges of a polygon are given and the direction, say, counterclockwise, along the polygon boundary. Then it is easily seen that these edges of the convex polygon are ordered by polar angle. Let us merge the ordered sequences of the directed edges from P and Q into a single ordered sequence S. Imagine that these edges are solid arrows which can be moved freely while keeping them parallel to their original direction. Assemble these arrows in the order of the sequence S by attaching the tail of the next arrow to the head of the previous arrow. It turns out that the resulting polygonal chain will in fact be a convex polygon which is the Minkowski sum of P and Q.
Other
If one polygon is convex and another one is not, the complexity of their Minkowski sum is O(nm). If both of them are nonconvex, their Minkowski sum complexity is O((mn)2).
Essential Minkowski sum
There is also a notion of the essential Minkowski sum +e of two subsets of Euclidean space. The usual Minkowski sum can be written as
A
+
B
=
{
z
∈
R
n
|
A
∩
(
z
−
B
)
≠
∅
}
.
{\displaystyle A+B=\left\{z\in \mathbb {R} ^{n}\,|\,A\cap (z-B)\neq \emptyset \right\}.}
Thus, the essential Minkowski sum is defined by
A
+
e
B
=
{
z
∈
R
n
|
μ
[
A
∩
(
z
−
B
)
]
>
0
}
,
{\displaystyle A+_{\mathrm {e} }B=\left\{z\in \mathbb {R} ^{n}\,|\,\mu \left[A\cap (z-B)\right]>0\right\},}
where μ denotes the n-dimensional Lebesgue measure. The reason for the term "essential" is the following property of indicator functions: while
1
A
+
B
(
z
)
=
sup
x
∈
R
n
1
A
(
x
)
1
B
(
z
−
x
)
,
{\displaystyle 1_{A\,+\,B}(z)=\sup _{x\,\in \,\mathbb {R} ^{n}}1_{A}(x)1_{B}(z-x),}
it can be seen that
1
A
+
e
B
(
z
)
=
e
s
s
s
u
p
x
∈
R
n
1
A
(
x
)
1
B
(
z
−
x
)
,
{\displaystyle 1_{A\,+_{\mathrm {e} }\,B}(z)=\mathop {\mathrm {ess\,sup} } _{x\,\in \,\mathbb {R} ^{n}}1_{A}(x)1_{B}(z-x),}
where "ess sup" denotes the essential supremum.
Lp Minkowski sum
For K and L compact convex subsets in
R
n
{\displaystyle \mathbb {R} ^{n}}
, the Minkowski sum can be described by the support function of the convex sets:
h
K
+
L
=
h
K
+
h
L
.
{\displaystyle h_{K+L}=h_{K}+h_{L}.}
For p ≥ 1, Firey defined the Lp Minkowski sum K +p L of compact convex sets K and L in
R
n
{\displaystyle \mathbb {R} ^{n}}
containing the origin as
h
K
+
p
L
p
=
h
K
p
+
h
L
p
.
{\displaystyle h_{K+_{p}L}^{p}=h_{K}^{p}+h_{L}^{p}.}
By the Minkowski inequality, the function hK+pL is again positive homogeneous and convex and hence the support function of a compact convex set. This definition is fundamental in the Lp Brunn-Minkowski theory.
See also
Blaschke sum – Polytope combining two smaller polytopes
Brunn–Minkowski theorem – theorem in geometryPages displaying wikidata descriptions as a fallback, an inequality on the volumes of Minkowski sums
Convolution – Integral expressing the amount of overlap of one function as it is shifted over another
Dilation – Operation in mathematical morphology
Erosion – Basic operation in mathematical morphology
Interval arithmetic – Method for bounding the errors of numerical computations
Mixed volume (a.k.a. Quermassintegral or intrinsic volume)
Parallel curve – Generalization of the concept of parallel lines
Shapley–Folkman lemma – Sums of sets of vectors are nearly convex
Sumset – Set of pairwise sums of elements of two sets
Topological vector space#Properties – Vector space with a notion of nearness
Zonotope – Convex polyhedron projected from hypercubePages displaying short descriptions of redirect targets
Notes
References
Arrow, Kenneth J.; Hahn, Frank H. (1980). General competitive analysis. Advanced textbooks in economics. Vol. 12 (reprint of (1971) San Francisco, CA: Holden-Day, Inc. Mathematical economics texts. 6 ed.). Amsterdam: North-Holland. ISBN 978-0-444-85497-1. MR 0439057.
Gardner, Richard J. (2002), "The Brunn-Minkowski inequality", Bull. Amer. Math. Soc. (N.S.), 39 (3): 355–405 (electronic), doi:10.1090/S0273-0979-02-00941-2
Green, Jerry; Heller, Walter P. (1981). "1 Mathematical analysis and convexity with applications to economics". In Arrow, Kenneth Joseph; Intriligator, Michael D (eds.). Handbook of mathematical economics, Volume I. Handbooks in economics. Vol. 1. Amsterdam: North-Holland Publishing Co. pp. 15–52. doi:10.1016/S1573-4382(81)01005-9. ISBN 978-0-444-86126-9. MR 0634800.
Henry Mann (1976), Addition Theorems: The Addition Theorems of Group Theory and Number Theory (Corrected reprint of 1965 Wiley ed.), Huntington, New York: Robert E. Krieger Publishing Company, ISBN 978-0-88275-418-5 – via www.krieger-publishing.com/subcats/MathematicsandStatistics/mathematicsandstatistics.html
Rockafellar, R. Tyrrell (1997). Convex analysis. Princeton landmarks in mathematics (Reprint of the 1979 Princeton mathematical series 28 ed.). Princeton, NJ: Princeton University Press. pp. xviii+451. ISBN 978-0-691-01586-6. MR 1451876.
Nathanson, Melvyn B. (1996), Additive Number Theory: Inverse Problems and Geometry of Sumsets, GTM, vol. 165, Springer, Zbl 0859.11003.
Oks, Eduard; Sharir, Micha (2006), "Minkowski Sums of Monotone and General Simple Polygons", Discrete & Computational Geometry, 35 (2): 223–240, doi:10.1007/s00454-005-1206-y.
Schneider, Rolf (1993), Convex bodies: the Brunn-Minkowski theory, Cambridge: Cambridge University Press.
Tao, Terence & Vu, Van (2006), Additive Combinatorics, Cambridge University Press.
Mayer, A.; Zelenyuk, V. (2014). "Aggregation of Malmquist productivity indexes allowing for reallocation of resources". European Journal of Operational Research. 238 (3): 774–785. doi:10.1016/j.ejor.2014.04.003.
Zelenyuk, V (2015). "Aggregation of scale efficiency". European Journal of Operational Research. 240 (1): 269–277. doi:10.1016/j.ejor.2014.06.038.
External links
"Minkowski addition", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
Howe, Roger (1979), On the tendency toward convexity of the vector sum of sets, Cowles Foundation discussion papers, vol. 538, Cowles Foundation for Research in Economics, Yale University
Minkowski Sums, in Computational Geometry Algorithms Library
The Minkowski Sum of Two Triangles and The Minkowski Sum of a Disk and a Polygon by George Beck, The Wolfram Demonstrations Project.
Minkowski's addition of convex shapes by Alexander Bogomolny: an applet
Wikibooks:OpenSCAD User Manual/Transformations#minkowski by Marius Kintel: Application
Application of Minkowski Addition to robotics by Joan Gerard
Demonstration of Minkowski additivity, convex monotonicity, and other properties of the Earth Movers distance
Kata Kunci Pencarian:
- Integral
- Minkowski addition
- Convex set
- Hermann Minkowski
- Minkowski
- Minkowski space
- Shapley–Folkman lemma
- Minkowski–Bouligand dimension
- Dilation (morphology)
- List of things named after Hermann Minkowski
- Support function
