Linear time approximation of 3D convex polytopes

AbstractWe develop algorithms for the approximation of a convex polytope in R3 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