Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids


We present efficient and simple algorithms for the approximation of a d-dimensional ellipsoid by polytopes of a prescribed size which are either contained in or contain the ellipsoid. The polytopes provided by our algorithms have a high degree of regularity, which enables us to construct their j-skeletons, j s 0, . . . , d y 1, efficiently. The rate of… (More)
DOI: 10.1006/jagm.1999.1031


2 Figures and Tables