English
Related papers

Related papers: Random ball-polytopes in smooth convex bodies

200 papers

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…

Probability · Mathematics 2024-12-02 Florian Besau , Anna Gusakova , Christoph Thäle

Facets of the convex hull of $n$ independent random vectors chosen uniformly at random from the unit sphere in $\mathbb{R}^d$ are studied. A particular focus is given on the height of the facets as well as the expected number of facets as…

Probability · Mathematics 2019-08-13 Gilles Bonnet , Eliza O'Reilly

For two convex discs $K$ and $L$, we say that $K$ is $L$-convex if it is equal to the intersection of all translates of $L$ that contain $K$. In $L$-convexity the set $L$ plays a similar role as closed half-spaces do in the classical notion…

Metric Geometry · Mathematics 2026-04-09 Ferenc Fodor , Dániel I. Papvári , Viktor Vígh

Consider a random set of points on the unit sphere in $\mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the…

Metric Geometry · Mathematics 2020-07-16 Arseniy Akopyan , Herbert Edelsbrunner , Anton Nikitenko

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

Probability · Mathematics 2021-03-03 Steven D. Hoehner , Carsten Schuett , Elisabeth M. Werner

In this survey, we discuss volumetric and combinatorial results concerning (mostly finite) intersections or unions of balls (mostly of equal radii) in the $d$-dimensional real vector space, mostly equipped with the Euclidean norm. Our first…

Metric Geometry · Mathematics 2025-12-30 Károly Bezdek , Zsolt Lángi , Márton Naszódi

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…

Computational Geometry · Computer Science 2026-01-26 Sunil Arya , Guilherme D. da Fonseca , David M. Mount

We study the Hausdorff distance between a random polytope, defined as the convex hull of i.i.d. random points, and the convex hull of the support of their distribution. As particular examples, we consider uniform distributions on convex…

Statistics Theory · Mathematics 2018-07-05 Victor-Emmanuel Brunel

A natural model for the approximation of a convex body $K$ in $\mathbb{R}^d$ by random polytopes is obtained as follows. Take a stationary Poisson hyperplane process in the space, and consider the random polytope $Z_K$ defined as the…

Probability · Mathematics 2019-08-27 Daniel Hug , Rolf Schneider

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…

Probability · Mathematics 2020-09-22 Alan Frieze , Wesley Pegden , Tomasz Tkocz

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$…

Metric Geometry · Mathematics 2019-08-19 Han Huang

For an isotropic convex body $K\subset\mathbb{R}^n$ we consider the isotropic constant $L_{K_N}$ of the symmetric random polytope $K_N$ generated by $N$ independent random points which are distributed according to the cone probability…

Metric Geometry · Mathematics 2018-07-09 Joscha Prochno , Christoph Thäle , Nicola Turchi

Let $\{X_i\}_{i=1}^{\infty}$ be a sequence of independent copies of a random vector $X$ in $\mathbb{R}^n$. We revisit the question to determine the asymptotic shape of the random polytope $K_N={\rm conv}\{X_1,\ldots ,X_N\}$ where $N>n$. We…

Metric Geometry · Mathematics 2025-08-22 Minas Pafis , Natalia Tziotziou

Let $\mathbb{P}_K(n)$ be the probability that $n$ points $z_1,\ldots,z_n$ picked uniformly and independently in $K$, a non-flat compact convex polygon in $\mathbb{R}^2$, are in convex position, that is, form the vertex set of a convex…

Probability · Mathematics 2026-05-19 Ludovic Morin

The convex hull $P_{n}$ of a Gaussian sample $X_{1},...,X_{n}$ in $R^{d}$ is a Gaussian polytope. We prove that the expected number of facets $E f_{d-1} (P_n)$ is monotonically increasing in $n$. Furthermore we prove this for random…

Probability · Mathematics 2017-06-27 Mareen Beermann , Matthias Reitzner

Central limit theorems for the log-volume of a class of random convex bodies in $\mathbb{R}^n$ are obtained in the high-dimensional regime, that is, as $n\to\infty$. In particular, the case of random simplices pinned at the origin and…

The Rolling Ball Theorem asserts that given a convex body K in Euclidean space and having a smooth surface bd(K) with all principal curvatures not exceeding c>0 at all boundary points, K necessarily has the property that to each boundary…

Differential Geometry · Mathematics 2009-03-30 Sz. Gy. Re've'sz

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…

Metric Geometry · Mathematics 2016-06-30 Grigoris Paouris , Peter Pivovarov

Let $x_1,\ldots ,x_N$ be independent random points distributed according to an isotropic log-concave measure $\mu $ on ${\mathbb R}^n$, and consider the random polytope $$K_N:={\rm conv}\{ \pm x_1,\ldots ,\pm x_N\}.$$ We provide sharp…

Metric Geometry · Mathematics 2016-01-12 Apostolos Giannopoulos , Labrini Hioni , Antonis Tsolomitis

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…

Functional Analysis · Mathematics 2026-02-27 Han Huang , Mark Rudelson