English
Related papers

Related papers: Optimal Volume-Sensitive Bounds for Polytope Appro…

200 papers

For all $n,\phi\in \mathbb{N}$ with $\phi\geqslant n+1$, the smallest possible isoperimetric quotient of an $n$-dimensional convex polytope that has $\phi$ facets is shown to be bounded from above and from below by positive universal…

Metric Geometry · Mathematics 2025-09-18 Keith Ball , Károly J. Böröczky , Assaf Naor

We provide a self contained proof of a result of Dudley [Dud64]} which shows that a bounded convex-body in $\Re^d$ can be $\varepsilon$-approximated, by the intersection of $O_d\bigl(\varepsilon^{-(d-1)/2} \bigr)$ halfspaces, where $O_d$…

Computational Geometry · Computer Science 2024-06-12 Sariel Har-Peled , Mitchell Jones

For a convex body $K\subset\R^n$ and $i\in\{1,...,n-1\}$, the function assigning to any $i$-dimensional subspace $L$ of $\R^n$, the $i$-dimensional volume of the orthogonal projection of $K$ to $L$, is called the $i$-th projection function…

Metric Geometry · Mathematics 2007-05-23 Ralph Howard , Daniel Hug

For a convex body $K\subset\R^n$, the $k$th projection function of $K$ assigns to any $k$-dimensional linear subspace of $\R^n$ the $k$-volume of the orthogonal projection of $K$ to that subspace. Let $K$ and $K_0$ be convex bodies in…

Metric Geometry · Mathematics 2007-05-23 Ralph Howard , Daniel Hug

The $k$-means problem is a classic objective for modeling clustering in a metric space. Given a set of points in a metric space, the goal is to find $k$ representative points so as to minimize the sum of the squared distances from each…

Computational Geometry · Computer Science 2026-03-31 Vincent Cohen-Addad , Karthik C. S. , David Saulpic , Chris Schwiegelshohn

We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X for which the membership question: ``given an x in V, does x belong to X?'' can be answered efficiently (in time polynomial in…

Metric Geometry · Mathematics 2007-05-23 Alexander Barvinok , Ellen Veomett

A polyhedral approximation of a convex body can be calculated by solving approximately an associated multiobjective convex program (MOCP). An MOCP can be solved approximately by Benson type algorithms, which compute outer and inner…

Optimization and Control · Mathematics 2024-01-26 Andreas Löhne , Fangyuan Zhao , Lizhen Shao

This paper introduces a natural definition for the volume of the unit ball in $n$-dimensional normed spaces $\mathbb{R}^n$. This definition preserves the Euclidean relation $P(B)/V(B)=n$ between the perimiter and the volume of the unit ball…

Metric Geometry · Mathematics 2026-05-05 Gershon Wolansky

This thesis consists of five papers about reduced spherical convex bodies and in particular spherical bodies of constant width on the $d$-dimensional sphere $S^d$. In paper I we present some facts describing the shape of reduced bodies of…

Metric Geometry · Mathematics 2024-09-12 Michał Musielak

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

Functional Analysis · Mathematics 2007-05-23 M. Rudelson

We prove sharp inequalities for the average number of affine diameters through the points of a convex body $K$ in ${\mathbb R}^n$. These inequalities hold if $K$ is either a polytope or of dimension two. An example shows that the proof…

Metric Geometry · Mathematics 2014-05-08 Imre Barany , Daniel Hug , Rolf Schneider

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

Gr\"unbaum's inequality guarantees that the centroid of a convex body has halfspace depth at least $1/e$: every halfspace containing the centroid captures at least a $1/e$ fraction of the body's volume. For mixed-integer convex sets…

Optimization and Control · Mathematics 2026-03-03 Hongyu Cheng , Amitabh Basu

Let $M$ be a compact $n$-dimensional Riemannian manifold with nonnegative Ricci curvature and mean convex boundary $\partial M$. Assume that the mean curvature $H$ of the boundary $\partial M$ satisfies $H \geq (n-1) k >0$ for some positive…

Differential Geometry · Mathematics 2020-01-06 Martin Li

We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…

Data Structures and Algorithms · Computer Science 2023-12-08 David Gamarnik , Devin Smedira

Given a centrally symmetric convex body $K \subset \mathbb{R}^d$ and a positive number $\lambda$, we consider, among all ellipsoids $E \subset \mathbb{R}^d$ of volume $\lambda$, those that best approximate $K$ with respect to the symmetric…

Metric Geometry · Mathematics 2018-06-05 Jairo Bochi

We present a survey article about the geometry of convex bodies on the $d$-dimensional sphere $S^d$. We concentrate on the results based on the notion of the width of a convex body $C \subset S^d$ determined by a supporting hemisphere of…

Metric Geometry · Mathematics 2021-06-30 Marek Lassak

We obtain a new extension of Rogers-Shephard inequality providing an upper bound for the volume of the sum of two convex bodies $K$ and $L$. We also give lower bounds for the volume of the $k$-th limiting convolution body of two convex…

Metric Geometry · Mathematics 2013-12-23 David Alonso-Gutiérrez , Bernardo González , Carlos Hugo Jiménez

Magnitude is an isometric invariant of metric spaces inspired by category theory. Recent work has shown that the asymptotic behavior under rescaling of the magnitude of subsets of Euclidean space is closely related to intrinsic volumes.…

Metric Geometry · Mathematics 2020-04-02 Mark W. Meckes

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
‹ Prev 1 3 4 5 6 7 10 Next ›