Related papers: Approximation of smooth convex bodies by random po…

Polyhedral-type approximations of convex-like domains in $\mathbb{C}^d$ have been considered recently by the second author. In particular, the decay rate of the error in optimal volume approximation as a function of the number of facets has…

We study the volume ratio between projections of two convex bodies. Given a high-dimensional convex body $K$ we show that there is another convex body $L$ such that the volume ratio between any two projections of fixed rank of the bodies…

It was shown by G. Pisier that any finite-dimensional normed space admits an $\alpha$-regular $M$-position, guaranteeing not only regular entropy estimates but moreover regular estimates on the diameters of minimal sections of its unit-ball…

In this article, we establish an analogue of the dimension growth conjecture, which is regarding the density of rational points on projective varieties, for compact submanifolds of $\mathbb{R}^n$ with non-vanishing curvature. We also…

Suppose we choose $N$ points uniformly randomly from a convex body in $d$ dimensions. How large must $N$ be, asymptotically with respect to $d$, so that the convex hull of the points is nearly as large as the convex body itself? It was…

Consider some convex body $K\subset\mathbb R^d$. Let $X_1,\dots, X_k$, where $k\leq d$, be random points independently and uniformly chosen in $K$, and let $\xi_k$ be a uniformly distributed random linear $k$-plane. We show that for…

Short and transparent proofs of central limit theorems for intrinsic volumes of random polytopes in smooth convex bodies are presented. They combine different tools such as estimates for floating bodies with Stein's method from probability…

We consider the question how well a floating body can be approximated by the polar of the illumination body of the polar. We establish precise convergence results in the case of centrally symmetric polytopes. This leads to a new affine…

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

The largest volume ratio of given convex body $K \subset \mathbb{R}^n$ is defined as $$\mbox{lvr}(K):= \sup_{L \subset \mathbb{R}^n} \mbox{vr}(K,L),$$ where the $\sup$ runs over all the convex bodies $L$. We prove the following sharp lower…

How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a notion of dispersion and connect it to asymptotic convex…

We present an efficient algorithm for uniformly sampling from an arbitrary compact body $\mathcal{X} \subset \mathbb{R}^n$ from a warm start under isoperimetry and a natural volume growth condition. Our result provides a substantial common…

A polyhedral approximation of a convex body can be calculated by solving approximately an associated multiobjective convex program (MOCP). An MOCP can be solved approximately by Benson type algorithms, which compute outer and inner…

Given a stationary and isotropic Poisson hyperplane process and a convex body $K$ in ${\mathbb R}^d$, we consider the random polytope defined by the intersection of all closed halfspaces containing $K$ that are bounded by hyperplanes of the…

Let $K \subset {\mathbb R}^2$ be an $o$-symmetric convex body, and $K^*$ its polar body. Then we have $|K|\cdot |K^*| \ge 8$, with equality if and only if $K$ is a parallelogram. ($| \cdot |$ denotes volume). If $K \subset {\mathbb R}^2$ is…

Let K be a convex set in R d and let K $\lambda$ be the convex hull of a homogeneous Poisson point process P $\lambda$ of intensity $\lambda$ on K. When K is a simple polytope, we establish scaling limits as $\lambda$ $\rightarrow$ $\infty$…

We establish estimates for the asymptotic best approximation of the Euclidean unit ball by polytopes under a notion of distance induced by the intrinsic volumes. We also introduce a notion of distance between convex bodies that is induced…

We obtain new upper bounds on the minimal density of lattice coverings of Euclidean space by dilates of a convex body K. We also obtain bounds on the probability (with respect to the natural Haar-Siegel measure on the space of lattices)…

Let $K$ be a convex pentagon in the plane and let $K_1$ be the pentagon bounded by the diagonals of $K$. It has been conjectured that the maximum of the ratio between the areas of $K_1$ and $K$ is reached when $K$ is an affine regular…

Traditional problems in computational geometry involve aspects that are both discrete and continuous. One such example is nearest-neighbor searching, where the input is discrete, but the result depends on distances, which vary continuously.…