Computing optimal triangulations of convex polytopes

by Jesus de Loera


We examine the difficulty of the problem: Given a convex d-polytope find a triangulation that uses K d-simplices. In the second part of the talk we discuss a polyhedral optimization approach to obtain explicit answers. We will present concrete experimental results (in particular the triangulations with minimal/maximal number of simplices for several famous polyhedra) as well an application to counting real roots of polynomials systems.

!!! Dieses Dokument stammt aus dem ETH Web-Archiv und wird nicht mehr gepflegt !!!
!!! This document is stored in the ETH Web archive and is no longer maintained !!!