相关论文: Floating body, illumination body, and polytopal ap…
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$.…
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…
The illumination number $I(K)$ of a convex body $K$ in Euclidean space $\mathbb{E}^d$ is the smallest number of directions that completely illuminate the boundary of a convex body. A cap body $K_c$ of a ball is the convex hull of a…
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…
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…
Generalizing results by Valette, Zamfirescu and Laczkovich, we will prove that a convex body $K$ is a polytope if there are sufficiently many tilings which contain a tile similar to $K$. Furthermore, we give an example that this can not be…
Let K be a d-dimensional convex body, and let $K^{(n)}$ be the intersection of n halfspaces containing $K$ whose bounding hyperplanes are independent and identically distributed. Under suitable distributional assumptions, we prove an…
We prove the following sparse approximation result for polytopes. Assume that $Q$ is a polytope in John's position. Then there exist at most $2d$ vertices of $Q$ whose convex hull $Q'$ satisfies $Q \subseteq - 2d^2 \, Q'$. As a consequence,…
In the polytope membership problem, a convex polytope $K$ in $\mathbb{R}^d$ is given, and the objective is to preprocess $K$ into a data structure so that, given any query point $q \in \mathbb{R}^d$, it is possible to determine efficiently…
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…
It is proved that if $C$ is a convex body in ${\Bbb R}^n$ then $C$ has an affine image $\widetilde C$ (of non-zero volume) so that if $P$ is any 1-codimensional orthogonal projection, $$|P\widetilde C| \ge |\widetilde C|^{n-1\over n}.$$ It…
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…
Let K and L be compact convex sets in R^n. The following two statements are shown to be equivalent: (i) For every polytope Q inside K having at most n+1 vertices, L contains a translate of Q. (ii) L contains a translate of K. Let 1 <= d <=…
The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…
Assume $K$ is a convex body in $R^d$, and $X$ is a (large) finite subset of $K$. How many convex polytopes are there whose vertices come from $X$? What is the typical shape of such a polytope? How well the largest such polytope (which is…
Giving a joint generalization of a result of Brazitikos, Chasapis and Hioni and results of Giannopoulos and Milman, we prove that roughly $\left\lceil \frac{d}{(1-\vartheta)^d}\ln\frac{1}{(1-\vartheta)^d} \right\rceil$ points chosen…
For a given convex body K in $R^d$, a random polytope $K^{(n)}$ is defined (essentially) as the intersection of $n$ independent closed halfspaces containing $K$ and having an isotropic and (in a specified sense) uniform distribution. We…
We study the volume ratio between projections of two convex bodies. Given a high-dimensional convex body $K$ we show that there is another convex body $L$ such that the volume ratio between any two projections of fixed rank of the bodies…
We obtain a formula for the number of horizontal equilibria of a planar convex body $K$ with respect to a center of mass $O$ in terms of the winding number of the evolute of $\partial K$ with respect to $O$. The formula extends to the case…
Let $K, D$ be $n$-dimensional convex bodes. Define the distance between $K$ and $D$ as $$ d(K,D) = \inf \{\lambda | T K \subset D+x \subset \lambda \cdot TK \}, $$ where the infimum is taken over all $x \in R^n$ and all invertible linear…