English
Related papers

Related papers: On polytopes with congruent projections or section…

200 papers

Let $P$ and $Q$ be two convex polytopes both contained in the interior of an Euclidean ball $r\textbf{B}^{d}$. We prove that $P=Q$ provided that their sight cones from any point on the sphere $rS^{d-1}$ are congruent. We also prove an…

Metric Geometry · Mathematics 2018-11-14 Sergii Myroshnychenko

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

Metric Geometry · Mathematics 2010-10-25 Daniel A. Klain

In this paper, we construct two convex bodies $K$ and $L$ in $\mathbb{R}^n$, $n\geq 3$, such that their projections $K|H$, $L|H$ onto every subspace $H$ are congruent, but nevertheless, $K$ and $L$ do not coincide up to a translation or a…

Functional Analysis · Mathematics 2017-11-29 Ning Zhang

Let $K$ and $L$ be two convex bodies in ${\mathbb R^4}$, such that their projections onto all $3$-dimensional subspaces are directly congruent. We prove that if the set of diameters of the bodies satisfy an additional condition and some…

Metric Geometry · Mathematics 2015-09-30 M. Angeles Alfonseca , Michelle Cordier , Dmitry Ryabogin

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…

Computational Geometry · Computer Science 2014-06-24 Sariel Har-Peled , Subhro Roy

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…

Geometric Topology · Mathematics 2007-05-29 Jaejeong Lee

Let $K$ and $L$ be two convex bodies in ${\mathbb R^5}$ with countably many diameters, such that their projections onto all $4$ dimensional subspaces containing one fixed diameter are directly congruent. We show that if these projections…

Metric Geometry · Mathematics 2018-01-30 M. Angeles Alfonseca , Michelle Cordier , Dmitry Ryabogin

We prove that if two convex bodies $ K, L \subset \mathbb{R}^3$ satisfy the property that the orthogonal projections of $K$ and $L$ onto every plane containing the origin are roations of each other, then either $K$ and $L$ coincide or $L$…

Classical Analysis and ODEs · Mathematics 2013-09-30 Benjamin Mackey

Let $A$ be a polytope in $\mathbb{R}^d$ (not necessarily convex or connected). We say that $A$ is spectral if the space $L^2(A)$ has an orthogonal basis consisting of exponential functions. A result due to Kolountzakis and Papadimitrakis…

Classical Analysis and ODEs · Mathematics 2019-11-05 Nir Lev , Bochen Liu

We prove that for every convex body $K$ with the center of mass at the origin and every $\varepsilon\in \left(0,\frac{1}{2}\right)$, there exists a convex polytope $P$ with at most $e^{O(d)}\varepsilon^{-\frac{d-1}{2}}$ vertices such that…

Classical Analysis and ODEs · Mathematics 2017-05-05 Márton Naszódi , Fedor Nazarov , Dmitry Ryabogin

In a previous paper, we showed how to use the Ehrhart function $L_P(s)$, defined by $L_P(s) = \#(sP \cap \mathbb Z^d)$, to reconstruct a polytope $P$. More specifically, we showed that, for rational polytopes $P$ and $Q$, if $L_{P + w}(s) =…

Combinatorics · Mathematics 2017-12-12 Tiago Royer

We consider two polytopes. The quadratic assignment polytope $QAP(n)$ is the convex hull of the set of tensors $x\otimes x$, $x \in P_n$, where $P_n$ is the set of $n\times n$ permutation matrices. The second polytope is defined as follows.…

Computational Complexity · Computer Science 2017-06-20 Aleksandr Maksimenko

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…

Metric Geometry · Mathematics 2021-12-16 Csaba Vincze , Márk Oláh , Letícia Lengyel

In this work we prove that if for a pair of convex bodies $K_1, K_2 \subset \mathbb{R}^n$, $n \geq 3$, there exists a hyperplane $H$ and two distinct points $p_1$ and $p_2$ in $\mathbb{R}^n \setminus H$ such that for every $(n-2)$-plane $M…

Metric Geometry · Mathematics 2026-02-03 Efren Morales-Amaya

A convex polyhedron $P$ is $k$-equiprojective if all of its orthogonal projections, i.e., shadows, except those parallel to the faces of $P$ are $k$-gon for some fixed value of $k$. Since 1968, it is an open problem to construct all…

Computational Geometry · Computer Science 2010-09-14 Masud Hasan , Mohammad Monoar Hossain , Alejandro López-Ortiz , Sabrina Nusrat , Saad Altaful Quader , Nabila Rahman

This work provides two sufficient conditions in terms of sections or projections for a convex body to be a polytope. These conditions are necessary as well.

Metric Geometry · Mathematics 2021-10-05 Sergii Myroshnychenko

In this paper we study the class of polytopes which can be obtained by taking the convex hull of some subset of the points $\{e_i-e_j \ \vert \ i \neq j\} \cup \{\pm e_i\}$ in $\mathbb{R}^n$, where $e_1,\dots,e_n$ is the standard basis of…

Combinatorics · Mathematics 2025-06-13 Konstanze Rietsch , Lauren Williams

In this work we present a theorem regarding two convex bodies $K_1, K_2\subset \mathbb{R}^{n}$, $n\geq 3$, and two families of sections of them, given by two families of tangent planes of two spheres $S_i\subset \textrm{int}\textrm{ } K_i$,…

Metric Geometry · Mathematics 2025-08-21 Efren Morales-Amaya

A convex polytope $P$ in the real projective space with reflections in the facets of $P$ is a Coxeter polytope if the reflections generate a subgroup $\Gamma$ of the group of projective transformations so that the $\Gamma$-translates of the…

Geometric Topology · Mathematics 2022-07-14 Suhyoung Choi , Gye-Seon Lee , Ludovic Marquis

A polyhedron is pointed if it contains at least one vertex. Every pointed polyhedron P in R^n can be described by an H-representation consisting of half spaces or equivalently by a V-representation consisting of the convex hull of a set of…

Optimization and Control · Mathematics 2025-10-10 David Avis
‹ Prev 1 2 3 10 Next ›