Loading...
2005
Proceedings of the 17th Canadian Conference on Computational Geometry
Computing All Faces of the Minkowski Sum of V-Polytopes
conference paper
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.
Loading...
Name
Fukuda2005_882.pdf
Access type
openaccess
Size
85.31 KB
Format
Adobe PDF
Checksum (MD5)
356bd5deb16ebcf541e58a673f23569c