Computing All Faces of the Minkowski Sum of V-Polytopes ∗

@inproceedings{Fukuda2005ComputingAF,
  title={Computing All Faces of the Minkowski Sum of V-Polytopes ∗},
  author={Komei Fukuda},
  year={2005}
}
We consider the problem of listing faces of the Minkowski sum of several V-polytopes in R. An algorithm for listing all faces of dimension up to j is presented, for any given 0 ≤ j ≤ d − 1. It runs in time polynomial in the sizes of input and output. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Spécification géometrique des produits : Methode de détérmination des tolérances

J.-P. Petit
Application en conception assistée par ordinateur. Ph.D Thesis, Univ. de Savoie, • 2004
View 2 Excerpts

Gröbner bases and convex polytopes University Lectures Series, 8, Amer

B. Sturmfels
Math. Soc., • 1996
View 1 Excerpt

Reverse Search for Enumeration

Discrete Applied Mathematics • 1996
View 1 Excerpt

and F . Margot Analysis of backtrack algorithms for linsting all vertices and all faces of a convex polyhedron

Th. Liebling Fukuda
Combinatorial face enumeration in convex polytopes In Combinatorial Geometry • 1994

Similar Papers

Loading similar papers…