Infoscience

Conference paper

Computing All Faces of the Minkowski Sum of V-Polytopes

We 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.

    Reference

    • ROSO-CONF-2005-001

    Record created on 2006-02-13, modified on 2016-08-08

Related material