Related papers: Optimal Volume-Sensitive Bounds for Polytope Appro…

We prove a randomized version of the generalized Urysohn inequality relating mean-width to the other intrinsic volumes. To do this, we introduce a stochastic approximation procedure that sees each convex body K as the limit of intersections…

Let ${\bf K} = (K_1, ..., K_n)$ be an $n$-tuple of convex compact subsets in the Euclidean space $\R^n$, and let $V(\cdot)$ be the Euclidean volume in $\R^n$. The Minkowski polynomial $V_{{\bf K}}$ is defined as $V_{{\bf K}}(\lambda_1, ...…

Using the concepts of mixed volumes and quermassintegrals of convex geometry, we derive an exact formula for the exclusion volume for a general convex body that applies in any space dimension, including both the rotationally-averaged…

We give a deterministic nearly-linear time algorithm for approximating any point inside a convex polytope with a sparse convex combination of the polytope's vertices. Our result provides a constructive proof for the Approximate…

The volume distance from a point p to a convex hypersurface M of the (N+1)-dimensional space is defined as the minimum (N+1)-volume of a region bounded by M and a hyperplane H through the point. This function is differentiable in a…

We consider two well-known problems: upper bounding the volume of lower dimensional ellipsoids contained in convex bodies given their John ellipsoid, and lower bounding the volume of ellipsoids containing projections of convex bodies given…

A classical result of Dowker (Bull. Amer. Math. Soc. 50: 120-122, 1944) states that for any plane convex body $K$, the areas of the maximum (resp. minimum) area convex $n$-gons inscribed (resp. circumscribed) in $K$ is a concave (resp.…

Our purpose here is to give an overview of known results and open questions concerning the volume product ${\mathcal P}(K)=\min_{z\in K}{\rm vol}(K){\rm vol}((K-z)^*)$ of a convex body $K$ in ${\mathbb R}^n$. We present a number of upper…

In the Euclidean $k$-center problem in sliding window model, input points are given in a data stream and the goal is to find the $k$ smallest congruent balls whose union covers the $N$ most recent points of the stream. In this model, input…

For every convex body $K \subset \mathbb R^n$ and $\delta \in (0,1)$, the $\delta$-convolution body of $K$ is the set of $x \in \mathbb R^n$ for which $\left|K \cap (K+x)\right|_n \geq \delta \left|K\right|_n$. We show that for $n=2$ and…

The simplex was conjectured to be the extremal convex body for the two following "problems of asymmetry":\\ P1) What is the minimal possible value of the quantity $\max_{K'} |K'|/|K|$? Here, $K'$ ranges over all symmetric convex bodies…

Motivated by the relative differential geometry, where the Euclidean normal vector of hypersurfaces is generalized by a relative normalization, we introduce anisotropic area measures of convex bodies, constructed with respect to a gauge…

For any origin-symmetric convex body $K$ in $\mathbb{R}^n$ in isotropic position, we obtain the bound: \[ M^*(K) \leq C \sqrt{n} \log(n)^2 L_K ~, \] where $M^*(K)$ denotes (half) the mean-width of $K$, $L_K$ is the isotropic constant of…

Union volume estimation is a classical algorithmic problem. Given a family of objects $O_1,\ldots,O_n \subseteq \mathbb{R}^d$, we want to approximate the volume of their union. In the special case where all objects are boxes (also known as…

We investigate the convex-body containment problem $\max\{s >0 : s Z \subseteq Q\}$, where the outer body $Q \subseteq \mathbb R^d$ is described by a membership oracle and the inner body $Z \subseteq \mathbb R^d$ is a zonotope. Our main…

We give a deterministic 2^{O(n)} algorithm for computing an M-ellipsoid of a convex body, matching a known lower bound. This has several interesting consequences including improved deterministic algorithms for volume estimation of convex…

In 1921 Blichfeldt gave an upper bound on the number of integral points contained in a convex body in terms of the volume of the body. More precisely, he showed that $#(K\cap\Z^n)\leq n! \vol(K)+n$, whenever $K\subset\R^n$ is a convex body…

We study the geometric knapsack problem in which we are given a set of $d$-dimensional objects (each with associated profits) and the goal is to find the maximum profit subset that can be packed non-overlappingly into a given…

We consider the problem of minimizing the relative perimeter under a volume constraint in an unbounded convex body $C\subset \mathbb{R}^{n+1}$, without assuming any further regularity on the boundary of $C$. Motivated by an example of an…

We study a general smallest intersecting ball problem and its soft-margin variant in high-dimensional Euclidean spaces for input objects that are compact and convex. These two problems link and unify a series of fundamental problems in…