English
Related papers

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

200 papers

Let M be a smooth strictly convex closed surface in space and denote by H the set of points x in the exterior of M such that all the tangent segments from x to M have equal lengths. In this note we prove that if H is either a closed surface…

Metric Geometry · Mathematics 2012-05-07 J. Jeronimo-Castro , G. Ruiz-Hernandez , S. Tabachnikov

We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…

Metric Geometry · Mathematics 2011-10-20 Karoly Bezdek , Zsolt Langi , Marton Naszodi , Peter Papez

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

In this note we prove two ellipsoid characterization theorems. The first one is that if $K$ is a convex body in a normed space with unit ball $M$, and for any point $p \notin K$ and in any 2-dimensional plane $P$ intersecting $\inter K$ and…

Metric Geometry · Mathematics 2012-11-07 Z. Langi

We received a solution of the shadow problem in n-dimensional Euclidean space for a family of sets, constructing from any convex domain having nonempty interior with the help of parallel translations and homotheties. We find a number of…

Metric Geometry · Mathematics 2015-11-06 Yu. B. Zelinskii , M. V. Stefanchuk

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

Given a polytope $\mathcal{P}$ in $\mathbb{R}^d$ and a subset $U$ of its vertices, is there a triangulation of $\mathcal{P}$ using $d$-simplices that all contain $U$? We answer this question by proving an equivalent and easy-to-check…

Metric Geometry · Mathematics 2018-03-09 Michael Kerber , Robert Tichy , Mario Weitzer

A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…

Metric Geometry · Mathematics 2025-06-24 José Ayala , David Kirszenblat , J. Hyam Rubinstein

Let n be any integer greater than two. We prove that there exists a projection P having the following properties. (1) P is not the projection of any unknotted knot. (2) The singular point set of P consists of double points. (3) P is the…

Geometric Topology · Mathematics 2007-05-23 Eiji Ogasa

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

Given a convex polyhedron $P$ of $n$ vertices inside a sphere $Q$, we give an $O(n^3)$-time algorithm that cuts $P$ out of $Q$ by using guillotine cuts and has cutting cost $O((\log n)^2)$ times the optimal.

Computational Geometry · Computer Science 2010-03-10 Syed Ishtiaque Ahmed , Masud Hasan , Md. Ariful Islam

Let $d$ be a positive integer. For a finite set $X \subseteq \mathbb{R}^d$, we define its integer cone as the set $\mathsf{IntCone}(X) := \{ \sum_{x \in X} \lambda_x \cdot x \mid \lambda_x \in \mathbb{Z}_{\geq 0} \} \subseteq \mathbb{R}^d$.…

Data Structures and Algorithms · Computer Science 2023-07-04 Łukasz Kowalik , Alexandra Lassota , Konrad Majewski , Michał Pilipczuk , Marek Sokołowski

We study the complexity of computing the projection of an arbitrary $d$-polytope along $k$ orthogonal vectors for various input and output forms. We show that if $d$ and $k$ are part of the input (i.e. not a constant) and we are interested…

Computational Complexity · Computer Science 2012-11-26 Hans Raj Tiwary

Behling, Bello-Cruz, Lara-Urdaneta, Oviedo, and Santos showed that the circumcentric direction $d$ of a finitely generated polyhedral cone $\KK\subset\RR^n$ admits an inscribed Euclidean ball of radius $\norm{d}^2$ inside the polar cone…

Optimization and Control · Mathematics 2026-04-30 Yunier Bello-Cruz

The symmetric convex hull of random points that are independent and distributed according to the cone probability measure on the $\ell_p$-unit sphere of $\mathbb R^n$ for some $1\leq p < \infty$ is considered. We prove that these random…

Functional Analysis · Mathematics 2017-03-14 Julia Hörrmann , Joscha Prochno , Christoph Thaele

In this note we present the solution of some isoperimetric problems in open convex cones of $\R^n$ in which perimeter and volume are measured with respect to certain nonradial weights. Surprisingly, Euclidean balls centered at the origin…

Analysis of PDEs · Mathematics 2012-10-10 Xavier Cabre , Xavier Ros-Oton , Joaquim Serra

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…

Metric Geometry · Mathematics 2016-09-06 Keith Ball

A subset of the d-dimensional Euclidean space having nonempty interior is called a spindle convex body if it is the intersection of (finitely or infinitely many) congruent d-dimensional closed balls. The spindle convex body is called a…

Metric Geometry · Mathematics 2013-02-13 Karoly Bezdek

We prove that projective spaces of Lorentzian and real stable polynomials are homeomorphic to closed Euclidean balls. This solves a conjecture of June Huh and the author. The proof utilizes and refines a connection between the symmetric…

Combinatorics · Mathematics 2023-06-22 Petter Brändén

Several recent papers have addressed the problem of characterizing the $f$-vectors of cubical polytopes. This is largely motivated by the complete characterization of the $f$-vectors of simplicial polytopes given by Stanley, Billera, and…

Combinatorics · Mathematics 2007-05-23 E. Babson , C. Chan