Concepedia

On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes

Hans Raj Tiwary

Discrete & Computational Geometry · 2008 · 103 citations · 14 references

DOIFull text

Open access

Concepts

References

14

Polynomial algorithms in linear programming

Leonid Khachiyan · USSR Computational Mathematics and Mathematical Physics · 1980 · 2K citations

, , +10

How good are convex hull algorithms?

David Avis, Raimund Seidel · Computational Geometry · 1997 · 259 citations

, , +11

On the Newton Polytope of the Resultant

Bernd Sturmfels · Journal of Algebraic Combinatorics · 1994 · 241 citations · Full text

, , +8

Proceedings of the 8th Canadian Conference on Computational Geometry

Frank Fiala, Evangelos Kranakis, Jörg-Rüdiger Sack · 1996 · 208 citations

, , +14

Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases

Peter Gritzmann, Bernd Sturmfels · SIAM Journal on Discrete Mathematics · 1993 · 195 citations

, , +13