Related papers: On equidistant polytopes in the Euclidean space
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…
This paper is devoted to some rotationally symmetric classes of graphs denoted in literature as convex polytope graphs. Exact value of equidistant dimension is found for $T_n$. Next, for even $n$ exact values are found for $R''_n$ and…
An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Having no effective formulas to compute the distance of a point and a set, it is hard to…
The equidistant set of two nonempty subsets $K$ and $L$ in the Euclidean plane is a set all of whose points have the same distance from $K$ and $L$. Since the classical conics can be also given in this way, equidistant sets can be…
An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Since there is no effective formula to compute the distance of a point and a set, it is hard to…
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…
An equilateral pentagon is a polygon in the plane with five sides of equal length. In this paper we classify the central configurations of the $5$-body problem having the five bodies at the vertices of an equilateral pentagon with an axis…
Convex polytopes are convex hulls of point sets in the $n$-dimensional space $\E^n$ that generalize 2-dimensional convex polygons and 3-dimensional convex polyhedra. We concentrate on the class of $n$-dimensional polytopes in $\E^n$ called…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
This article studies a large, general class of orthogonal polytopes which we may call "generic orthotopes". These objects emerged from a desire to represent a Coxeter complex by an orthogonal polytope that is particularly nice with respect…
Any convex polytope whose combinatorial automorphism group has two orbits on the flags is isomorphic to one whose group of Euclidean symmetries has two orbits on the flags (equivalently, to one whose automorphism group and symmetry group…
A perfect (Delaunay) ellipsoid is an ellipsoid in n-dimensional Euclidean space that does not contain integral points in its interior, but is uniquely defined by integral points that lie on its surface. A perfect Delaunay polytope with…
The van der Waerden's theorem reads that an equilateral pentagon in Euclidean 3-space $\Bbb E^3$ with all diagonals of the same length is necessarily planar and its vertex set coincides with the vertex set of some convex regular pentagon.…
It is conjectured since long that for any convex body $P\subset \mathbb{R}^n$ there exists a point in its interior which belongs to at least $2n$ normals from different points on the boundary of $P$. The conjecture is known to be true for…
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…
Points of an orbit of a finite Coxeter group G, generated by n reflections starting from a single seed point, are considered as vertices of a polytope (G-polytope) centered at the origin of a real n-dimensional Euclidean space. A general…
A closed convex polytope in n dimensions defined by m linear inequality constraints is considered. If L is a straight line drawn in any direction from any feasible point P, then in general, it intersects every constraint at one point,…
This article is devoted to the study of classical and new results concerning equidistant sets, both from the topological and metric point of view. We start with a review of the most interesting known facts about these sets in the euclidean…
If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…