Computing faces up to k dimensions of a Minkowski sum of 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 (CCCG'05), 38, 256-259
Presented at:
Canadian Conference on Computational Geometry, Windsor, Canada, August 10-12, 2005
Year:
2005
Keywords:
Laboratories:




 Record created 2007-01-05, last modified 2018-01-27

External links:
Download fulltextURL
Download fulltextn/a
Rate this document:

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