Weibel, ChristopheFukuda, Komei2007-01-052007-01-052007-01-052005https://infoscience.epfl.ch/handle/20.500.14299/238676We consider the problem of listing faces of the Minkowski sum of several V-polytopes in R^d. 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.Minkowski SumsPolytopesFace enumerationComputing faces up to k dimensions of a Minkowski sum of polytopestext::conference output::conference proceedings::conference paper