a Department of Mathematics and Computer Science, University of Denver, Denver, CO 80208, USA
b Department of Mathematics and Department of Mathematics Education (Oranim), University of Haifa, Haifa 31905, Israel
Abstract:
We develop algorithms for the approximation of a convex polytope in by polytopes that are either contained in it or containing it, and that have fewer vertices or facets, respectively. The approximating polytopes achieve the best possible general order of precision in the sense of volume-difference. The running time is linear in the number of vertices or facets.