Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Computing All Faces of the Minkowski Sum of V-Polytopes
 
Loading...
Thumbnail Image
conference paper

Computing All Faces of the Minkowski Sum of V-Polytopes

Fukuda, K.  
•
Weibel, Ch.
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.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

Fukuda2005_882.pdf

Access type

openaccess

Size

85.31 KB

Format

Adobe PDF

Checksum (MD5)

356bd5deb16ebcf541e58a673f23569c

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés