Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

COMPGEOM

2007

ACM

2007

ACM

For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it is impossible to verify in polynomial time whether Q = P1 + P2, unless P = NP. In particular, this shows that there is no output sensitive polynomial algorithm to compute the facets of the Minkowski sum of two arbitrary H-polytopes even if we consider only rational polytopes. Since the convex hull of the union and the intersection of two polytopes relate naturally to the Minkowski sum via the Cayley trick and polarity, similar hardness results follow for these operations as well. Categories and Subject Descriptors: F.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems General Terms: Algorithm, Theory

Related Content

Added |
14 Aug 2010 |

Updated |
14 Aug 2010 |

Type |
Conference |

Year |
2007 |

Where |
COMPGEOM |

Authors |
Hans Raj Tiwary |

Comments (0)