Related papers: Convex Hull Calculations: a Matlab Implementation …
An exact expression for the symbol error probability of the four-dimensional 24-cell in Gaussian noise is derived. Corresponding expressions for other regular convex polytopes are summarized. Numerically stable versions of these error…
A new robust algorithm for the numerical computation of biarcs, i.e. $G^1$ curves composed of two arcs of circle, is presented. Many algorithms exist but are based on geometric constructions, which must consider many geometrical…
This paper reviews some recent applications of the theory of the compensated convex transforms or of the proximity hull as developed by the authors to image processing and shape interrogation with special attention given to the Hausdorff…
The infinite models in integer programming can be described as the convex hull of some points or as the intersection of halfspaces derived from valid functions. In this paper we study the relationships between these two descriptions. Our…
Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…
We apply the techniques developed by Marcus, Spielman and Srivastava, working with principal submatrices in place of rank $1$ decompositions to give an alternate proof of their results on restricted invertibility. We show that one can find…
The increase in the observed volume in cosmological surveys imposes various challenges on simulation preparations. Firstly, the volume of the simulations required increases proportionally to the observations. However, large-volume…
We derive a closed form description of the convex hull of mixed-integer bilinear covering set with bounds on the integer variables. This convex hull description is determined by considering some orthogonal disjunctive sets defined in a…
We study properties of convex hulls of (co)adjoint orbits of compact groups, with applications to invariant theory and tensor product decompositions. The notion of partial convex hulls is introduced and applied to define two numerical…
We study the problem of synthesizing polyhedral Lyapunov functions for hybrid linear systems. Such functions are defined as convex piecewise linear functions, with a finite number of pieces. We first prove that deciding whether there exists…
Seeking the convex hull of an object is a very fundamental problem arising from various tasks. In this work, we propose two variational convex hull models using level set representation for 2-dimensional data. The first one is an exact…
We describe a pure divide-and-conquer parallel algorithm for computing 3D convex hulls. We implement that algorithm on GPU hardware, and find a significant speedup over comparable CPU implementations.
We study the problem of binary classification from the point of view of learning convex polyhedra in Hilbert spaces, to which one can reduce any binary classification problem. The problem of learning convex polyhedra in finite-dimensional…
We investigate the explicit convex relaxation of the ideal magnetohydrodynamics equations. We provide a non-trivial lower estimate on the lamination hull and an upper estimate on the $\Lambda$-convex hull, the latter providing inequalities…
The standard techniques for online learning of combinatorial objects perform multiplicative updates followed by projections into the convex hull of all the objects. However, this methodology can be expensive if the convex hull contains many…
Let C be a real nonsingular affine curve of genus one, embedded in affine n-space, whose set of real points is compact. For any polynomial f which is nonnegative on C(R), we prove that there exist polynomials f_i with f \equiv \sum_i f_i^2…
Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erd\H{o}s-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2)$ space complexity that compute: (1) A subset $S$ of $P$…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
Given a graph with edges colored red or blue and an integer $k$, the exact perfect matching problem asks if there exists a perfect matching with exactly $k$ red edges. There exists a randomized polylogarithmic-time parallel algorithm to…
The power of Clifford or, geometric, algebra lies in its ability to represent geometric operations in a concise and elegant manner. Clifford algebras provide the natural generalizations of complex, dual numbers and quaternions into…