We present an algorithm for computing the convex hull of freeform rational surfaces. The convex hull problem is reformulated as one of finding the zero-sets of polynomial equation...
Joon-Kyung Seong, Gershon Elber, John K. Johnstone...
Based on a recent duality theory for linear differential inclusions (LDIs), the condition for stability of an LDI in terms of one Lyapunov function can be easily derived from that...
Tingshu Hu, Rafal Goebel, Andrew R. Teel, Zongli L...
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
We show that any point in the convex hull of each of (d + 1) sets of (d + 1) points in Rd is contained in at least (d + 2)2 /4 simplices with one vertex from each set.
The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we reveal the face structure of the contact polytope of the Leech lattice. We classify i...
: This paper studies the convex hull of n random points in Rd. A recently-proved topological identity of the author is used in combination with identities of Efron and Buchta to fi...
We present a procedure to split (or segment) touching numerals. We are neither assuming a dominant orientation for the text direction nor long character strings. The basic idea is...