相关论文: Approximation of convex bodies by polytopes with r…

Approximating convex bodies is a fundamental question in geometry, which has a wide variety of applications. Given a convex body $K$ in $\textbf{R}^d$ for fixed $d$, the objective is to minimize the number of facets of an approximating…

The distance between convex bodies \(K, L \subseteq \R^n\) is defined as \[ d(K,L)= \inf \left\{ \lambda \ge 1: \ L-x \subseteq T (K-y) \subseteq \lambda (L-x) \right\}, \] where the infimum is taken over all \(x,y \in \R^n\) and all…

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 derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…

Approximating convex bodies is a fundamental problem in geometry. Given a convex body $K$ in $\mathbb{R}^d$ for a fixed dimension $d$, the objective is to minimize the number of facets of an approximating polytope for a given Hausdorff…

This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter…

We prove that for every convex body $K$ with the center of mass at the origin and every $\varepsilon\in \left(0,\frac{1}{2}\right)$, there exists a convex polytope $P$ with at most $e^{O(d)}\varepsilon^{-\frac{d-1}{2}}$ vertices such that…

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…

Coverings of convex bodies have emerged as a central component in the design of efficient solutions to approximation problems involving convex bodies. Intuitively, given a convex body $K$ and $\epsilon> 0$, a covering is a collection of…

For a given convex body K in $R^d$, a random polytope $K^{(n)}$ is defined (essentially) as the intersection of $n$ independent closed halfspaces containing $K$ and having an isotropic and (in a specified sense) uniform distribution. We…

Let $\gamma^d_m(K)$ be the smallest positive number $\lambda$ such that the convex body $K$ can be covered by $m$ translates of $\lambda K$. Let $K^d$ be the $d$-dimensional crosspolytope. It will be proved that $\gamma^d_m(K^d)=1$ for…

Recall that a convex body $K$ is in John's position if the unit Euclidean ball is the maximal volume ellipsoid contained in $K$. Approximating convex body in John's position by polytopes we obtain the following results. 1. Let $n>R_n\ge 1$…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

A convex body $R$ in $\mathbb R^d$ is called reduced if the minimal width $\Delta(R')$ of each convex body $R'\subset R$ different from $R$ is strictly smaller than the minimal width $\Delta(R)$ of $R$. In this article we construct a…

Let $K$ be a convex body in $\mathbb{R}^n$ and $f : \partial K \rightarrow \mathbb{R}_+$ a continuous, strictly positive function with $\int\limits_{\partial K} f(x) d \mu_{\partial K}(x) = 1$. We give an upper bound for the approximation…

Let K be a d-dimensional convex body, and let $K^{(n)}$ be the intersection of n halfspaces containing $K$ whose bounding hyperplanes are independent and identically distributed. Under suitable distributional assumptions, we prove an…

We prove that there is an absolute constant $ C$ such that for every $ n \geq 2 $ and $ N\geq 10^n, $ there exists a polytope $ P_{n,N} \subset \mathbb{R}^n $ with at most $ N $ facets that satisfies…

For a given $\lambda >0$, a convex body in $\mathbb R^n$ is $\lambda$-convex if it is the intersection of (finitely or infinitely many) balls of radius $1/\lambda$. In this note, we show that among all $\lambda$-convex bodies in $\mathbb…

Let $K$ be a convex body in $\mathbb{R}^d$ which slides freely in a ball. Let $K^{(n)}$ denote the intersection of $n$ closed half-spaces containing $K$ whose bounding hyperplanes are independent and identically distributed according to a…

For a convex body $K \subset {\mathbb R}^n$, let $K^z = \{y\in{\mathbb R}^n : \langle y-z, x-z\rangle\le 1, \mbox{\ for all\ } x\in K\}$ be the polar body of $K$ with respect to the center of polarity $z \in {\mathbb R}^n$. The goal of this…