Related papers: Folding polyominoes into cubes
A perfect cuboid is a rectangular parallelepiped with integer edges, integer face diagonals, and integer space diagonal. Such cuboids have not yet been found, but nor has their existence been disproved. Perfect cuboids are described by a…
We address the unsolved problem of unfolding prismatoids in a new context, viewing a "topless prismatoid" as a convex patch---a polyhedral subset of the surface of a convex polyhedron homeomorphic to a disk. We show that several natural…
Triple orthogonal coordinate systems having coordinate lines as circles or straight lines are considered. Technically, they are represented by trilinear rational quaternionic maps and are called Dupin cyclidic cubes, naturally generalizing…
Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and…
The shape of crystalline nanoparticles (NP) can often be described by polyhedra with flat facet surfaces. Thus, structural studies of polyhedral bodies can help to describe geometric details of NPs. Here we consider compact polyhedra of…
Classification theory and the study of projective varieties which are covered by rational curves of minimal degrees naturally leads to the study of families of singular rational curves. Since families of arbitrarily singular curves are hard…
In this paper, we study boundedness questions for (simply-connected) smooth Calabi-Yau threefolds. The diffeomorphism class of such a threefold is known to be determined up to finitely many possibilities by the integral middle cohomology…
This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…
When can a plane graph with prescribed edge lengths and prescribed angles (from among $\{0,180^\circ, 360^\circ$\}) be folded flat to lie in an infinitesimally thin line, without crossings? This problem generalizes the classic theory of…
One of the strategies to detect the pose and shape of unknown objects is their geometric modeling, consisting on fitting known geometric entities. Classical geometric modeling fits simple shapes such as spheres or cylinders, but often those…
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonoverlapping rigid planar shapes (Jordan regions) that are hinged…
Compact polyhedra of cubic point symmetry Oh, exhibit surfaces of planar sections (facets) characterized by normal vector families {abc} with up to 48 members each, compatible with Oh symmetry. We focus first on polyhedra confined by facets…
In this paper, we consider polynomials associated with faces and internal quadrilaterals of a cuboctahedron and classify them under the requirement that they are consistent. These polynomials give rise to a system of partial difference…
We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a…
A toric cube is a subset of the standard cube defined by binomial inequalities. These basic semialgebraic sets are precisely the images of standard cubes under monomial maps. We study toric cubes from the perspective of topological…
Spherical particles confined to a sphere surface cannot pack densely into a hexagonal lattice without defects. In this study, we use hard particle Monte Carlo simulations to determine the effects of continuously deformable shape anisotropy…
In the usual aim of discrete tomography, the reconstruction of an unknown discrete set is considered, by means of projection data collected along a set $U$ of discrete directions. Possible ambiguous reconstructions can arise if and only if…
We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the…
Congruent polygons are congruent in angles as well as in edge lengths. We concentrate on the angle aspect, and investigate how tilings of the sphere by congruent pentagons can be determined by the angle information only. We also investigate…
In this article we consider an open conjecture about coherently labelling a polyhedron in three dimensions. We exhibit all the forty eight possible coherent labellings of a tetrahedron. We also exhibit that some simplicial polyhedra like…