Related papers: Uniform Behaviors of Random Polytopes under the Ha…

While there is extensive literature on approximation, deterministic as well as random, of general convex bodies $K$ in the symmetric difference metric, or other metrics arising from intrinsic volumes, very little is known for corresponding…

Approximate a smooth convex body $K$ with nonvanishing curvature by the convex hull of $n$ independent random points sampled from its boundary $\partial K$. In case the points are distributed according to the optimal density, we prove that…

We prove an exponential deviation inequality for the convex hull of a finite sample of i.i.d. random points with a density supported on an arbitrary convex body in $\R^d$, $d\geq 2$. When the density is uniform, our result yields rate…

We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…

We investigate the asymptotic properties of random polytopes arising as convex hulls of $n$ independent random points sampled from a family of block-beta distributions. Notably, this family includes the uniform distribution on a product of…

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…

We study approximations of smooth convex bodies by random ball-polytopes. We examine the following probability model: let $K\subset{\bf R}^d$ be a convex body such that $K$ slides freely in a ball of radius $R>0$ and has $C^2$ smooth…

Let $\mu$ be a probability distribution on $\mathbb{R}^d$ which assigns measure zero to every hyperplane and $S$ a set of points sampled independently from $\mu$. What can be said about the expected combinatorial structure of the convex…

We estimate the support of a uniform density, when it is assumed to be a convex polytope or, more generally, a convex body in $\R^d$. In the polytopal case, we construct an estimator achieving a rate which does not depend on the dimension…

We examine how the measure and the number of vertices of the convex hull of a random sample of $n$ points from an arbitrary probability measure in $\mathbf{R}^d$ relates to the wet part of that measure. This extends classical results for…

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…

We show that the convex hull of a large i.i.d. sample from an absolutely continuous log-concave distribution approximates a predetermined convex body in the logarithmic Hausdorff distance and in the Banach-Mazur distance. For log-concave…

The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…

We study the problem of estimating the convex hull of the image $f(X)\subset\mathbb{R}^n$ of a compact set $X\subset\mathbb{R}^m$ with smooth boundary through a smooth function $f:\mathbb{R}^m\to\mathbb{R}^n$. Assuming that $f$ is a…

In this paper we consider the problem of constructing numerical algorithms for approximating of convex compact bodies in d-dimensional Euclidean space by polytopes with any given accuracy. It is well known that optimal with respect to the…

A popular class of problem in statistics deals with estimating the support of a density from $n$ observations drawn at random from a $d$-dimensional distribution. The one-dimensional case reduces to estimating the end points of a univariate…

In this paper, we give an overview of some results concerning best and random approximation of convex bodies by polytopes. We explain how both are linked and see that random approximation is almost as good as best approximation.

The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…

We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed…

Let $K$ be a convex body in $\R^d$, let $j\in\{1, ..., d-1\}$, and let $\varrho$ be a positive and continuous probability density function with respect to the $(d-1)$-dimensional Hausdorff measure on the boundary $\partial K$ of $K$. Denote…