Loading...
conference paper
Computing All Faces of the Minkowski Sum of V-Polytopes
2005
Proceedings of the 17th Canadian Conference on Computational Geometry
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.
Type
conference paper
Author(s)
Date Issued
2005
Journal
Proceedings of the 17th Canadian Conference on Computational Geometry
Start page
253
End page
256
Written at
EPFL
EPFL units
Available on Infoscience
February 13, 2006
Use this identifier to reference this record