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.


Published in:
Proceedings of the 17th Canadian Conference on Computational Geometry, 253-256
Year:
2005
Laboratories:




 Record created 2006-02-13, last modified 2018-01-27

External link:
Download fulltext
n/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)