On the Exact Maximum Complexity of Minkowski Sums of Polytopes

@article{Fogel2009OnTE,
title={On the Exact Maximum Complexity of Minkowski Sums of Polytopes},
author={Efi Fogel and Dan Halperin and Christophe Weibel},
journal={Discrete & Computational Geometry},
year={2009},
volume={42},
pages={654-669}
}

We present a tight bound on the exact maximum complexity of Minkowski sums of polytopes in R. In particular, we prove that the maximum number of facets of the Minkowski sum of k polytopes with m1, m2, . . . , mk facets respectively is bounded from above by

Handbook of Discrete and Computational Geometry, 2nd Ed. • 2004

View 1 Excerpt

Latombe . Robotics

C. D. Hodgson, I. Rivin, W. D. Smith.

Handbook of Discrete and Computational Geometry • 2004

Manocha . Collision and proximity queries

J. E. Goodman

Handbook of Discrete and Computational Geometry • 2004

Robotics

D. Halperin, L. Kavraki, J.-C. Latombe

J. E. Goodman and J. O’Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 48, pages 1065–1093. Chapman & Hall/CRC, 2nd edition, • 2004