Better Late than Never: the Complexity of Arrangements of Polyhedra

Boris Aronov, Sang Won Bae, Sergio Cabello +4

Let $\mathcal{A}$ be the subdivision of ${\mathbb{R}}^d$ induced by $m$ convex polyhedra having $n$ facets in total. We prove that $\mathcal{A}$ has combinatorial complexity $O(m^{\l…