Related papers: Illuminating and covering convex bodies

We give new bounds on the Erdos-Szekeres theorems for convex bodies of Bisztriczky and Fejes Toth and of Pach and Toth. We derive them from a combinatorial characterization of convex position of a family of planar convex bodies. This…

We show that there exist convex bodies of constant width in $\mathbb{E}^n$ with illumination number at least $(\cos(\pi/14)+o(1))^{-n}$, answering a question by G. Kalai. Furthermore, we prove the existence of finite sets of diameter $1$ in…

We show that the lattice Hadwiger number of superballs is exponential in the dimension. The same is true for some more general convex bodies.

The "old-new" concept of convex-hull function was investigated by several authors in the last seventy years. A recent research on it led to some other volume functions as the covariogram function, the widthness function or the so-called…

We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…

We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…

Several characterizations of complex ellipsoids among convex bodies in Cn, in terms of their sections and projections are proved. Characterizing complex symmetry in similar terms is an important tool.

Homotopy coherence has a considerable history, albeit also by other names. For this volume highlighting symmetries, the appropriate use is: Homotopy coherence of representations, at one time known as strong homotopy representations. We…

In the convex covering problem, we are given a convex polygon with holes $P$ and the goal is to cover $P$ using a small number of convex polygons that lie inside $P$. In this paper, we solve the problem using the following strategy. We find…

Let $K$ be a convex body in $\Bbb R^{d}$ and $K_{t}$ its floating bodies. There is a polytope with at most $n$ vertices that satisfies $$ K_{t} \subset P_{n} \subset K $$ where $$ n \leq e^{16d} \frac{vol_{d}(K \setminus K_{t})}{t\…

We investigate weighted floating bodies of polytopes. We show that the weighted volume depends on the complete flags of the polytope. This connection is obtained by introducing flag simplices, which translate between the metric and…

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 prove new Alexandrov-Fenchel type inequalities and new affine isoperimetric inequalities for mixed $p$-affine surface areas. We introduce a new class of bodies, the illumination surface bodies, and establish some of their properties. We…

This paper investigates the use of automatic continuity techniques in the context of valuations on convex bodies. We first provide an automatic continuity theorem for valuations restricted to parallelotopes with respect to a fixed basis.…

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

The illumination number $I(K)$ of a convex body $K$ in Euclidean space $\mathbb{E}^d$ is the smallest number of directions that completely illuminate the boundary of a convex body. A cap body $K_c$ of a ball is the convex hull of a…

We present a mathematical and algorithmic scheme for learning the principal geometric elements in an image or 3D object. We build on recent work that convexifies the basic problem of finding a combination of a small number shapes that…

We suggest a new optical solution for solving the YES/NO version of the Exact Cover problem by using the massive parallelism of light. The idea is to build an optical device which can generate all possible solutions of the problem and then…

We survey some principal results and open problems related to colorings of geometric and algebraic objects endowed with symmetries, concentrating the exposition on the maximal symmetry numbers of such objects.

We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer…