Related papers: Minkowski sum of polytopes and its normality
Lattice polytopes which possess the integer decomposition property (IDP for short) turn up in many fields of mathematics. It is known that if the Cayley sum of lattice polytopes possesses IDP, then so does their Minkowski sum. In this…
In this paper, we discuss the integer decomposition property for Cayley sums and Minkowski sums of lattice polytopes. In fact, we characterize when Cayley sums have the integer decomposition property in terms of Minkowski sums. Moreover, by…
We investigate the structure of the Minkowski sum of standard simplices in ${\reals}^r$. In particular, we investigate the one-dimensional structure, the vertices, their degrees and the edges in the Minkowski sum polytope.
\emph{Minkowski rings} are certain rings of simple functions on the Euclidean space $W = {\mathbb{R}}^d$ with multiplicative structure derived from Minkowski addition of convex polytopes. When the ring is (finitely) generated by a set…
We investigate how the Minkowski sum of two polytopes affects their graph and, in particular, their diameter. We show that the diameter of the Minkowski sum is bounded below by the diameter of each summand and above by, roughly, the product…
In 2012 Gubeladze (Adv.\ Math.\ 2012) introduced the notion of k-convex-normal polytopes to show that integral polytopes all of whose edges are longer than 4d(d+1) have the integer decomposition property. In the first part of this paper we…
The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes we call perfectly centered and the combinatorial properties of the Minkowski sum with…
Every polyhedron can be decomposed into a Minkowski sum (or vector sum) of a bounded polyhedron and a polyhedral cone. This paper establishes similar statements for some classes of discrete sets in discrete convex analysis, such as…
Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
We propose a method to efficiently compute the Minkowski sum, denoted by binary operator $\oplus$ in the paper, of convex polytopes in $\Re^d$ using their face lattice structures as input. In plane, the Minkowski sum of convex polygons can…
This paper develops and compares algorithms to compute inner approximations of the Minkowski sum of convex polytopes. As an application, the paper considers the computation of the feasibility set of aggregations of distributed energy…
Signed Minkowski decomposition is an expression of a polytope as a Minkowski sum and difference of smaller polytopes. Signed Minkowski decompositions of a polytope can be interpreted as factorizations of a max-plus (tropical) function. We…
We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1\oplus{}P_2$, of two $d$-dimensional convex polytopes $P_1$ and $P_2$, as a function of the number of vertices of the polytopes.…
Let $\mathcal{P} \subset \mathbb{R}^N$ be an integral convex polytope of dimension $d$ and write $k \mathcal{P}$, where $k = 1, 2, \ldots$, for dilations of $\mathcal{P}$. We say that $\mathcal{P}$ possesses the integer decomposition…
In this paper, we discuss the toric ideals of Minkowski sums of unit simplices. More precisely, we prove that the toric ideal of Minkowski sum of unit simplices has a squarefree initial ideal and is generated by quadratic binomials.…
Let $\mathcal{P} \subset \mathbb{R}^{d}$ and $\mathcal{Q} \subset \mathbb{R}^e$ be integral convex polytopes of dimension $d$ and $e$ which contain the origin of $\mathbb{R}^{d}$ and $\mathbb{R}^e$, respectively. In the present paper, under…
Polytopes in R^n with integral vertices form a monoid under the Minkowski sum, and the Grothendieck construction gives rise to a group. We show that every symmetric polytope is a norm in this group for every n.
We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…
In this article we compare the set of integer points in the homothetic copy $n\Pi$ of a lattice polytope $\Pi\subseteq\R^d$ with the set of all sums $x_1+\cdots+x_n$ with $x_1,...,x_n\in \Pi\cap\Z^d$ and $n\in\N$. We give conditions on the…