Related papers: On recognizing shapes of polytopes from their shad…

Let $2\le k\le d-1$ and let $P$ and $Q$ be two convex polytopes in ${\mathbb E^d}$. Assume that their projections, $P|H$, $Q|H$, onto every $k$-dimensional subspace $H$, are congruent. In this paper we show that $P$ and $Q$ or $P$ and $-Q$…

In this work we prove the following: let $K$ be a convex body in the Euclidean space $\mathbb{R}^n$, $n\geq 3$, contained in the interior of the unit ball of $\mathbb{R}^n$, and let $p\in \mathbb{R}^n$ be a point such that, from each point…

One of the most important problems in Geometric Tomography is to establish properties of a given convex body if we know some properties over its sections or its projections. There are many interesting and deep results that provide…

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…

A shadow of a geometric object $A$ in a given direction $v$ is the orthogonal projection of $A$ on the hyperplane orthogonal to $v$. We show that any topological embedding of a circle into Euclidean $d$-space can have at most two shadows…

Let $M$ be a convex body and let $K$ be a closed convex surface $K$ both contained in the Euclidean space $\mathbb{E}^3$. What can we say about $M$ if $K$ encloses $M$ and if from all the points in $K$ the body $M$ looks the same? In this…

An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…

In this work we prove the following result: Let $K$ be a strictly convex body in the Euclidean space $\mathbb{R}^n, n\geq 3$, and let $L$ be a hypersurface, which is the image of an embedding of the sphere $\mathbb{S}^{n-1}$, such that $K$…

Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real projective manifold M which is obtained by gluing together the polytopes in P along their facets in such a way that the union of any two adjacent polytopes…

Let $K$ and $L$ be two convex bodies in $\mathbb R^n$, $n\geq 3$, with $L\subset \text{int}\, K$. In this paper we prove the following result: if every two parallel chords of $K$, supporting $L$ have the same length, then $K$ and $L$ are…

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

We derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…

A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a finite set of balls in Euclidean space is repositioned so that…

We investigate the asymptotic best approximation of a smooth, strictly convex body $K$ in $\mathbb{R}^d$ by inscribed polytopes with a restricted number of vertices under the intrinsic volume difference. We prove rigidity phenomena in both…

Let $\mathcal{P}$ and $\mathcal{P}'$ be $3$-dimensional convex polytopes in $\mathbb{R}^3$ and $S \subseteq \mathbb{R}^3$ be a non-empty intersection of an open set with a sphere. As a consequence of a somewhat more general result it is…

A "shadow" of a subset $S$ of Euclidean space is an orthogonal projection of $S$ into one of the coordinate hyperplanes. In this paper we show that it is not possible for all three shadows of a cycle (i.e., a simple closed curve) in…

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…

The problem of determining whether a given quantum state is separable is known to be computationally difficult. We develop an approach to this problem based on approximations of convex polytopes in high dimensions. By showing that a convex…

We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…

We construct examples of two convex bodies $K,L$ in $\mathbb{R}^n$, such that every projection of $K$ onto a $(n-1)$-dimensional subspace can be rotated to be contained in the corresponding projection of $L$, but $K$ itself cannot be…