On the hardness of minkowski addition and related operations

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2007, Pages 306-309

  Tiwary, Hans Raj ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

Computational geometry; CoNP hardness; Extended convex hull; Minkowski addition; Polytope intersection; Polytopes; Turing reduction

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; POLYNOMIALS;

EXTENDED CONVEX HULL; MINKOWSKI ADDITION; POLYTOPE INTERSECTION; POLYTOPES; TURING REDUCTION;

THEOREM PROVING;

EID: 35348863669     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247069.1247124     Document Type: Conference Paper

References (16)

1. D. Avis and K. Fukuda. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete & Computational. Geometry, 8:295-313, 1992.
2. E. Balas. On the convex hull of the union of certain polyhedra. Operations Research Letters, 7:279-283, 1988.
3. A. Bemporad, K. Fukuda, and F. D. Torrisi. Convexity recognition of the union of polyhedra. Comput. Geom, 18(3): 141-154, 2001.
4. D. Bremner, K. Fukuda, and A. Marzetta. Primal - dual methods for vertex and facet enumeration. Discrete & Computational Geometry, 20(3):333-357, 1998.
5. M. R. Bussieck and M. E. Lübbecke. The vertex set of a 0/1-polytope is strongly P-enumerable. Comput. Geom, 11(2): 103-109, 1998.
6. M. E. Dyer, A. M. Frieze, and R. Kannan. A random polynomial time algorithm for approximating the volume of convex bodies. J. ACM, 38(1):1-17, 1991.
7. K. Fukuda. From the zonotope construction to the minkowski addition of convex polytopes. J. Symb. Comput., 38(4):1261-1272, 2004.
8. K. Fukuda, T. M. Liebling, and C. Lutolf. Extended convex hull. Computational Geometry, 20(1-2): 13-23, 2001.
9. K. Fukuda and C. Weibel. Computing all faces of the minkowski sum of V-polytopes. In Proceedings of the 17th Canadian Conference on Computational Geometry, 2005.
10. Gritzmann and Sturmfels. Minkowski addition of polytopes: Computational complexity and applications to grobner bases. SIJDM: SIAM Journal on Discrete Mathematics, 6, 1993.
11. B. Grünbaum. Convex Polytopes. Wiley Interscience Publ.,London, 1967.
12. K.Fukuda and C. Weibel. On f-vectors of minkowski additions of convex polytopes. Technical report, 2005. submitted to DCG.
13. L. Khachiyan, E. Boros, K. Borys, K. M. Elbassioni, and V. Gurvich. Generating all vertices of a polyhedron is hard. In SODA, pages 758-765. ACM Press, 2006.
14. L. G. Khachiyan. A polynomial algorithm in linear programming. Soviet Mathematics Doklady, 20:191-194, 1979.
15. J. S. Provan. Efficient enumeration of the vertices of polyhedra associated with network LP's. Math. Program, 63:47-64, 1994.
16. G. M. Ziegler. Lectures on Polytopes. Graduate Texts in Mathematics, No. 152. Springer-Verlag, Berlin, 1995.