A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes

Autor:	Karavelas, Menelaos I., Tzanaki, Eleni
Rok vydání:	2015
Předmět:	Computer Science - Computational Geometry Mathematics - Combinatorics 52B05 52B11 52C45 68U05 F.2.2 G.2.1
Druh dokumentu:	Working Paper
Popis:	We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1+...+P_r$, of $r$ convex $d$-polytopes $P_1,...,P_r$ in $\mathbb{R}^d$, where $d\ge{}2$ and $rComment: 43 pages; minor changes (mostly typos)
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1502.02265 Zobrazit plný text záznamu View this record from Arxiv