On the exact maximum complexity of Minkowski sums of polytopes (Q1042457): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00454-009-9159-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979867394 / rank | |||
Normal rank | |||
Latest revision as of 18:43, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the exact maximum complexity of Minkowski sums of polytopes |
scientific article |
Statements
On the exact maximum complexity of Minkowski sums of polytopes (English)
0 references
14 December 2009
0 references
It is shown that, if \(P_1, \dots, P_k\) are 3-dimensional convex polytopes lying in \(\mathbb R^3\) and if, for \(1\leq i \leq k\), \(m_i\) is the number of facets of \(P_i\), then the number of facets of the Minkowski sum \(P_1 + \cdots + P_k\) is at most \(4\sum_{1\leq i<j \leq k}m_im_j - (10k-11)\sum_{1\leq i \leq k} m_i + 26 {k\choose 2}\). Examples show that this bound can be achieved.
0 references
polyhedra
0 references
Minkowski sums
0 references
Gaussian maps
0 references
complexity
0 references
