On the hardness of computing intersection, union and minkowski sum of polytopes

68Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

For polytopes P 1,P 2⊂ℝd , we consider the intersection P 1∩P 2, the convex hull of the union CH(P 1∪P 2), and the Minkowski sum P 1+P 2. For the Minkowski sum, we prove that enumerating the facets of P 1+P 2 is NP-hard if P 1 and P 2 are specified by facets, or if P 1 is specified by vertices and P 2 is a polyhedral cone specified by facets. For the intersection, we prove that computing the facets or the vertices of the intersection of two polytopes is NP-hard if one of them is given by vertices and the other by facets. Also, computing the vertices of the intersection of two polytopes given by vertices is shown to be NP-hard. Analogous results for computing the convex hull of the union of two polytopes follow from polar duality. All of the hardness results are established by showing that the appropriate decision version, for each of these problems, is NP-complete. © 2008 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Tiwary, H. R. (2008). On the hardness of computing intersection, union and minkowski sum of polytopes. Discrete and Computational Geometry, 40(3), 469–479. https://doi.org/10.1007/s00454-008-9097-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free