Gaps in the Numbers of Vertices of Cubical Polytopes, I.
Goffin's algorithm for zonotopes
The Löwner-John ellipse of a full-dimensional bounded convex set is a circumscribed ellipse with the property that if we shrink it by the factor (where is dimension), we obtain an inscribed ellipse. Goffin’s algorithm constructs, in polynomial time, a tight approximation of the Löwner-John ellipse of a polyhedron given by facet description. In this text we adapt the algorithm for zonotopes given by generator descriptions. We show that the adapted version works in time polynomial in the size...