English
Related papers

Related papers: Random polytopes and affine surface area

200 papers

Convex polytopes are convex hulls of point sets in the $n$-dimensional space $\E^n$ that generalize 2-dimensional convex polygons and 3-dimensional convex polyhedra. We concentrate on the class of $n$-dimensional polytopes in $\E^n$ called…

Quantum Physics · Physics 2010-12-15 Colin Wilmott , Hermann Kampermann , Dagmar Bruss

A {\em convex hole} (or {\em empty convex polygon)} of a point set $P$ in the plane is a convex polygon with vertices in $P$, containing no points of $P$ in its interior. Let $R$ be a bounded convex region in the plane. We show that the…

Computational Geometry · Computer Science 2012-06-06 József Balogh , Hernán González-Aguilar , Gelasio Salazar

Given a convex body K in R^n and p in R, we introduce and study the extremal inner and outer affine surface areas IS_p(K) = sup_{K'\subseteq K} (as_p(K') ) and os_p(K)=inf_{K'\supseteq K} (as_p(K') ), where as_p(K') denotes the L_p-affine…

Functional Analysis · Mathematics 2020-02-26 O. Giladi , H. Huang , C. Schütt , E. M. Werner

We study the number of facets of the convex hull of n independent standard Gaussian points in d-dimensional Euclidean space. In particular, we are interested in the expected number of facets when the dimension is allowed to grow with the…

Probability · Mathematics 2024-01-11 Karoly J Boroczky , Gabor Lugosi , Matthias Reitzner

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

The cut polytope ${\rm CUT}(n)$ is the convex hull of the cut vectors in a complete graph with vertex set $\{1,\ldots,n\}$. It is well known in the area of combinatorial optimization and recently has also been studied in a direct relation…

Discrete Mathematics · Computer Science 2018-12-11 Nevena Maric

Let $A$ be a compact $d$-dimensional $C^2$ Riemannian manifold with boundary, embedded in ${\bf R}^m$ where $m \geq d \geq 2$, and let $B$ be a nice subset of $A$ (possibly $B=A$). Let $X_1,X_2, \ldots $ be independent random uniform points…

Probability · Mathematics 2025-09-24 Mathew D. Penrose , Xiaochuan Yang

We study the natural extended-variable formulation for the disjunction of $n+1$ polytopes in $\mathbb{R}^d$. We demonstrate that the convex hull $D$ in the natural extended-variable space $\mathbb{R}^{d+n}$ is given by full optimal big-M…

Optimization and Control · Mathematics 2024-11-01 Yushan Qu , Jon Lee

Kernel quadrature can exploit RKHS spectral structure and outperform Monte Carlo on smooth integrands, but optimized quadrature weights are generally signed and may be numerically unstable. We study whether spectral acceleration remains…

Numerical Analysis · Mathematics 2026-05-08 Satoshi Hayakawa

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

Let $K$ and $K_0$ be convex bodies in $\mathbb{R}^d$, such that $K$ contains the origin, and define the process $(K_n, p_n)$, $n \geq 0$, as follows: let $p_{n+1}$ be a uniform random point in $K_n$, and set $K_{n+1} = K_n \cap (p_{n+1} +…

Probability · Mathematics 2014-06-26 Péter Kevei , Viktor Vígh

Let $S$ be a set of $n$ points in $\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\lceil…

Computational Geometry · Computer Science 2014-02-04 Adrian Dumitrescu , Sariel Har-Peled , Csaba D. Tóth

In this article we consider non-convex $4d$ polytopes in $\mathbb{R}^4$. The paper consist of two parts: Firstly, we extend the proof of the formula for the $4d$ volume in terms of $2d$ face bivectors and boundary graph crossings from…

General Relativity and Quantum Cosmology · Physics 2018-12-27 Benjamin Bahr

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

Let $X_1,X_2, \ldots $ be independent random uniform points in a bounded domain $A \subset \mathbb{R}^d$ with smooth boundary. Define the coverage threshold $R_n$ to be the smallest $r$ such that $A$ is covered by the balls of radius $r$…

Probability · Mathematics 2022-01-12 Mathew D. Penrose

For a convex body $K\subset\mathbb{R}^d$ the mean distance $\Delta(K)=\mathbb{E}|X_1-X_2|$ is the expected Euclidean distance of two independent and uniformly distributed random points $X_1,X_2\in K$. Optimal lower and upper bounds for…

Metric Geometry · Mathematics 2021-06-22 Gilles Bonnet , Anna Gusakova , Christoph Thäle , Dmitry Zaporozhets

Using equivariant topology, we prove that it is always possible to find $n$ points in the $d$-dimensional faces of a $nd$-dimensional convex polytope $P$ so that their center of mass is a target point in $P$. Equivalently, the $n$-fold…

Metric Geometry · Mathematics 2014-06-06 Michael Gene Dobbins

We consider moments of the normalized volume of a symmetric or nonsymmetric random polytope in a fixed symmetric convex body. We investigate for which bodies these moments are extremized, and calculate exact values in some of the extreme…

Metric Geometry · Mathematics 2007-05-23 Mark W. Meckes

The isotropic constant $L_K$ is an affine-invariant measure of the spread of a convex body $K$. For a $d$-dimensional convex body $K$, $L_K$ can be defined by $L_K^{2d} = \det(A(K))/(\mathrm{vol}(K))^2$, where $A(K)$ is the covariance…

Functional Analysis · Mathematics 2015-12-09 Luis Rademacher

An identity due to Efron dating from 1965 relates the expected volume of the convex hull of $n$ random points to the expected number of vertices of the convex hull of $n+1$ random points. Forty years later this identity was extended from…

Probability · Mathematics 2022-10-04 Christian Buchta