We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Convex and continuous energy formulations for low level
vision problems enable efficient search procedures for the
corresponding globally optimal solutions. In this work we
exte...
Christopher Zach (UNC Chapel Hill), Marc Niethamme...
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
In this work, a systematic approach to plant-wide control design is proposed. The method combines ingredients from process networks, thermodynamics and systems theory to derive ro...
Luis T. Antelo, Irene Otero-Muras, Julio R. Banga,...
We introduce revlex-initial 0/1-polytopes as the convex hulls of reverse-lexicographically initial sets of 0/1-vectors. Thus for each n 2d , we consider the 0/1-knapsack polytope ...