Related papers: Optimal Area-Sensitive Bounds for Polytope Approxi…

A classical result of Dowker (Bull. Amer. Math. Soc. 50: 120-122, 1944) states that for any plane convex body $K$, the areas of the maximum (resp. minimum) area convex $n$-gons inscribed (resp. circumscribed) in $K$ is a concave (resp.…

We introduce the flag-approximability of a convex body to measure how easy it is to approximate by polytopes. We show that the flag-approximability is exactly half the volume entropy of the Hilbert geometry on the body, and that both…

Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…

We prove that if a convex body has absolutely continuous surface area measure, whose density is sufficiently close to the constant, then the sequence $\{\Pi^mK\}$ of convex bodies converges to the ball with respect to the Banach-Mazur…

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

We study the min-max optimization problem where each function contributing to the max operation is strongly-convex and smooth with bounded gradient in the search domain. By smoothing the max operator, we show the ability to achieve an…

We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…

We develop two simple and efficient approximation algorithms for the continuous $k$-medians problems, where we seek to find the optimal location of $k$ facilities among a continuum of client points in a convex polygon $C$ with $n$ vertices…

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.

Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this…

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…

We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…

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…

It is well known that every convex body in a finite dimensional normed space can be uniformly approximated by strictly convex and smooth convex bodies. However, in the case of infinite dimensions, little progress has been made since Klee…

Let $C\subset \mathbb{S}^2$ be a spherical convex body of constant width $\tau$. It is known that (i) if $\tau<\pi/2$ then for any $\varepsilon>0$ there exists a spherical convex body $C_\varepsilon$ of constant width $\tau$ whose boundary…

Halfspace (or Tukey) depth is a fundamental and robust measure of centrality of data points in multivariate datasets. Computing the depth of a point with respect to the uniform distribution on an open convex body in $\mathbb{R}^d$ is a…

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…

For any origin-symmetric convex body $K$ in $\mathbb{R}^n$ in isotropic position, we obtain the bound: \[ M^*(K) \leq C \sqrt{n} \log(n)^2 L_K ~, \] where $M^*(K)$ denotes (half) the mean-width of $K$, $L_K$ is the isotropic constant of…

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…

We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly…