Computing All Faces of the Minkowski Sum of V-Polytopes
Fukuda, K.; Weibel, Ch.
2005

Files

Abstract

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.

Details

Title Computing All Faces of the Minkowski Sum of V-Polytopes
Author(s) Fukuda, K. ; Weibel, Ch.
Published in Proceedings of the 17th Canadian Conference on Computational Geometry
Pages 253-256
Date 2005
Laboratories ROSO
Record Appears in Scientific production and competences > SB - School of Basic Sciences > SB Archives > ROSO - Chair of Operations Research SO
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Conference Papers
Work produced at EPFL
Published
Record creation date 2006-02-13

Actions

Preview