Polytope approximation and the Mahler volume

The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices (alternatively, the number of facets) of an approximating polytope for a given Hausdorff error ε. Results to date have been of two types. The first type assumes that K is smooth, and bounds hold in the limit as ε tends to zero. The second type requires no such assumptions. The latter type includes the well known results of Dudley (1974) and Bronshteyn and Ivanov (1976), which show that in spaces of fixed dimension, O((diam(K)/ε)(d−1)/2 ) vertices (alt., facets) suffice. Our results are of this latter type. In our first result, under the assumption that the width of the body in any direction is at least ε, we strengthen the above bound to O( √ area(K)/ε(d−1)/2 ). This is never worse than the previous bound (by more than logarithmic factors) and may be significantly better for skinny bodies. Ou...

• Type: Journal
• Year: 2012
• Where: SODA
• Authors: Sunil Arya, Guilherme Dias da Fonseca, David M. Mount
• Keywords: Algorithms, Convex Body, Convex Polytope, Research Grants Council, SODA 2012