DIMACS TR: 94-31

On the Complexity of Some Basic Problems in Computational Convexity: II. Volume and mixed volumes

Authors: Peter Gritzmann and Victor Klee


This paper is the second part of a broader survey of computational convexity, an area of mathematics that has crystallized around a variety of results, problems and applications involving interactions among convex geometry, mahematical programmiong and computer science. The first part discussed containment problems. This second part is concerned with computing volumes and mixed volumes of convex polytopes and more general convex bodies.

Paper available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1994/94-31.ps
DIMACS Home Page