… zonotopes. Since ZP (Y) is contained in the positive orthant and has 0 as vertex, we will need
to approximate it with zonotopes … approximating sequence of zonotopes with the rectangle […

… Neumaier’s algorithms because it uses zonotopes for enclosing the uncertainty instead of
… and non contractive, the zonotope that includes the family of zonotopes at each time instant …

… The set of extreme points of the hypercube corresponding to the extreme points of the
zonotope is denoted by set . Hence, the solution of the quadratic optimization problem can be ob…

… splitdecomposable metric are zonotopes that are polytope isomorphic to … zonotope. It clearly
suffices to show that any maximal cell in T(d) is a zonotope, since every face of a zonotope …

… The first part of the dissertation studies the use of zonotopes (Minkowski sums of line seg…
, we show an O(nlog2 n) algorithm to compute the minimum area enclosing zonotope in IR …

… hier nun stellvertretend für die überapproximativen Verfahren die sogenannte zonotope
Approximation vorgestellt. Zonotope sind eine spezielle Klasse von Polytopen, die ursprünglich …

… Thus, a simplex and a zonotope are both polytopes. A convex polytope in R d is a zonotope
if all its 2-dimensional faces are cen trally symmetric. An octahedron is not a zonotope, since …

… A zonotope is a Minkowski sum of closed segments, equivalently, a zonotope is the projection
of an n-cube onto a subspace. The zonotope determined by a subspace V of Rn is the …

… le zonotope Dy,k,1 avec le polytope Dy,k,1. La même construction a été faite pour les
zonotopes issus des deux autres mod`eles. Afin de ne pas représenter les zonotopes obtenus `a …

… In Chapter 9, we study a concrete class of polytopes—projections of cubes, which go by the
name zonotopes—whose discrete volume is tractable and has neat connections to number …