Related papers: Fine approximation of convex bodies by polytopes

In the paper "Isoperimetry of waists and local versus global asymptotic convex geometries", it was proved that the existence of nicely bounded sections of two symmetric convex bodies K and L implies that the intersection of randomly rotated…

It was shown in \cite{GL} that the maximal surface area of a convex set in $\mathbb{R}^n$ with respect to a rotation invariant log-concave probability measure $\gamma$ is of order $\frac{\sqrt{n}}{\sqrt[4]{Var|X|} \sqrt{\mathbb{E}|X|}}$,…

Let $E$ be an arbitrary subset of the unit circle $T$ and let $f$ be a function defined on $E$. When there exist polynomials $P_n$ which are uniformly bounded by a number $M > 0$ on $T$ and converge (pointwise) to $f$ at each point of $E$?…

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1\oplus{}P_2$, of two $d$-dimensional convex polytopes $P_1$ and $P_2$, as a function of the number of vertices of the polytopes.…

Let $K\subset \mathbb{R}^n$ be a convex body and let $p$ in the interior of $ K$, $n \geq 3$. The point $p$ is said to be a \textit{Larman point} of $K$ if, for every hyperplane $\Pi$ passing through $p$, the section $\Pi\cap K$ has a…

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…

The Gauss--Lucas theorem states that any convex set $K\subset\mathbb{C}$ which contains all $n$ zeros of a degree $n$ polynomial $p\in\mathbb{C}[z]$ must also contain all $n-1$ critical points of $p$. In this paper we explore the following…

A convex polytope $P$ in the real projective space with reflections in the facets of $P$ is a Coxeter polytope if the reflections generate a subgroup $\Gamma$ of the group of projective transformations so that the $\Gamma$-translates of the…

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…

Consider the random polytope, that is given by the convex hull of a Poisson point process on a smooth convex body in $\mathbb{R}^d$. We prove central limit theorems for continuous motion invariant valuations including the Will's functional…

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…

We show that the volume of a convex body in $\mathbb{R}^{n}$ in the general membership oracle model can be computed to within relative error $\varepsilon$ using $\widetilde{O}(n^{3.5}\psi^{2} + n^3/\varepsilon^{2})$ oracle queries, where…

$\renewcommand{\Re}{\mathbb{R}}\newcommand{\eps}{{\varepsilon}}\newcommand{\poly}{\mathrm{poly}} $In this paper, we study the problem of $L_1$-fitting a shape to a set of $n$ points in $\Re^d$ (where $d$ is a fixed constant), where the…

If K' and K are convex bodies of the plane such that K' is a subset of K then the perimeter of K' is not greater than the perimeter of K. We obtain the following generalization of this fact. Let K be a convex compact body of the plane with…

We present algorithms for the $(1+\epsilon)$-approximate version of the closest vector problem for certain norms. The currently fastest algorithm (Dadush and Kun 2016) for general norms has running time of $2^{O(n)} (1/\epsilon)^n$. We…

The cone-volume measure of a polytope with centroid at the origin is proved to satisfy the subspace concentration condition. As a consequence a conjectured (a dozen years ago) fundamental sharp affine isoperimetric inequality for the…

Let $K$ be an $n$-dimensional convex body. Define the difference body by $$ K-K= \{x-y \mid x,y \in K \}. $$ We estimate the volume of the section of $K-K$ by a linear subspace $F$ via the maximal volume of sections of $K$ parallel to $F$.…

Let $d \ge 2$, and let $K \subset {\Bbb{R}}^d$ be a convex body containing the origin $0$ in its interior. In a previous paper we have proved the following. The body $K$ is $0$-symmetric if and only if the following holds. For each $\omega…

In this paper we proved the following: \emph{Let $K, L\subset \mathbb R^3$ be two $O$-symmetric convex bodies with $L\subset \emph{int} K$ strictly convex. Suppose that from every $x$ in $\emph{bd} K$ the graze $\Sigma(L,x)$ is a planar…