Related papers: Rigid ball-polyhedra in Euclidean 3-space

This paper studies the straight skeleton of polyhedra in three dimensions. We first address voxel-based polyhedra (polycubes), formed as the union of a collection of cubical (axis-aligned) voxels. We analyze the ways in which the skeleton…

How much of the combinatorial structure of a pointed polyhedron is contained in its vertex-facet incidences? Not too much, in general, as we demonstrate by examples. However, one can tell from the incidence data whether the polyhedron is…

We show that a realization of a closed connected PL-manifold of dimension n-1 in Euclidean n-space (n>2) is the boundary of a convex polyhedron if and only if the interior of each (n-3)-face has a point, which has a neighborhood lying on…

We investigate the intersections of balls of radius $r$, called $r$-ball bodies, in Euclidean $d$-space. An $r$-lense (resp., $r$-spindle) is the intersection of two balls of radius $r$ (resp., balls of radius $r$ containing a given pair of…

The celebrated Dvoretzky theorem asserts that every $N$-dimensional convex body admits central sections of dimension $d = \Omega(\log N)$, which is nearly spherical. For many instances of convex bodies, typically unit balls with respect to…

The $R$-hulloid, in the Euclidean space $\mathbb{R}^3$, of the set of vertices $V$ of a tetrahedron $T$ is the minimal closed set containing $V$ such that its complement is the union of open balls of radius $R$. When $R$ is greater than the…

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical, Euclidean and…

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

We investigate a novel setting for polytope rigidity, where a flex must preserve edge lengths and the planarity of faces, but is allowed to change the shapes of faces. For instance, the regular cube is flexible in this notion. We present…

We consider Meissner polyhedra in $\mathbb{R}^3$. These are constant width bodies whose boundaries consist of pieces of spheres and spindle tori. We define these shapes by taking appropriate intersections of congruent balls and show that…

Extending previous results on a characterization of all equilateral triangle in space having vertices with integer coordinates ("in $\mathbb Z^3$"), we look at the problem of characterizing all regular polyhedra (Platonic Solids) with the…

This paper is devoted to the study of the $m$-point homogeneity property for the vertex sets of polytopes in Euclidean spaces. In particular, we present the classifications of $2$-point and $3$-point homogeneous polyhedra in $\mathbb{R}^3$.

Let V be a finite set of points in Euclidean d-space (d >= 2). The intersection of all unit balls B(v,1) centered at v, where v ranges over V, henceforth denoted by B(V) is the ball polytope associated with V. Note that B(V) is non-empty…

It is conjectured that all decomposable (i.e. interior can be triangulated without adding new vertices) polyhedra with vertices in convex position are infinitesimally rigid and only recently has it been shown that this is indeed true under…

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…

A chiral polyhedron has a geometric symmetry group with two orbits on the flags, such that adjacent flags are in distinct orbits. Part I of the paper described the discrete chiral polyhedra in ordinary Euclidean 3-space with finite skew…

We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…

If all tiles in a tiling are congruent, the tiling is called monohedral. Tiling by convex polygons is called edge-to-edge if any two convex polygons are either disjoint or share one vertex or one entire edge in common. In this paper, we…

We consider a compact hyperbolic tetrahedron of a general type. It is a convex hull of four points called vertices in the hyperbolic space $\mathbb{H}^3$. It can be determined by the set of six edge lengths up to isometry. For further…

Here we propose a class of frameworks in the plane, braced polygons, that may be globally rigid and are analogous to convex polyopes in 3 space that are rigid by Cauchy's rigidity Theorem in 1813.