Page 1

Displaying 1 – 2 of 2

Showing per page

Goffin's algorithm for zonotopes

Michal Černý (2012)

Kybernetika

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 n (where n 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...

Currently displaying 1 – 2 of 2

Page 1