Related papers: Edge-Unfolding Prismatoids: Tall or Rectangular Ba…

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…

In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut…

It is proved that every series-parallel digraph whose maximum vertex-degree is $\Delta$ admits an upward planar drawing with at most one bend per edge such that each edge segment has one of $\Delta$ distinct slopes. This is shown to be…

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…

We show that every polycube tree can be unfolded with a 4x4 refinement of the grid faces. This is the first constant refinement unfolding result for polycube trees that are not required to be well-separated.

Using the orthogonal connectedness, we introduce the notion of orthogonal decomposability of convex polytopes and study it in the case of Platonic and Archimedean solids. While doing so, we also encounter polytopes which are not…

This paper is a study of the interaction between the combinatorics of boundaries of convex polytopes in arbitrary dimension and their metric geometry. Let S be the boundary of a convex polytope of dimension d+1, or more generally let S be a…

Let C be a simple, closed, directed curve on the surface of a convex polyhedron P. We identify several classes of curves C that "live on a cone," in the sense that C and a neighborhood to one side may be isometrically embedded on the…

Nestohedra are a family of convex polytopes that includes permutohedra, associahedra, and graph associahedra. In this paper, we study an extension of such polytopes, called extended nestohedra. We show that these objects are indeed the…

We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…

A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…

We prove that any finite polyhedral manifold in 3D can be continuously flattened into 2D while preserving intrinsic distances and avoiding crossings, answering a 19-year-old open problem, if we extend standard folding models to allow for…

In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…

We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…

We consider the multilinear polytope defined as the convex hull of the feasible region of a linearized binary polynomial optimization problem. We define a relaxation in an extended space for this polytope, which we refer to as the complete…

We have developed a general method for constructing a set of non-orthogonal bases with equal separations between all different basis' states in prime dimensions.It results that the corresponding bi-orthogonal counterparts are pairwise…

It is shown how the Beneath-and-Beyond algorithm can be used to yield another proof of the equivalence of V- and H-representations of convex polytopes. In this sense this paper serves as the sketch of an introduction to polytope theory with…

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…

Given a convex polyhedral surface P, we define a tailoring as excising from P a simple polygonal domain that contains one vertex v, and whose boundary can be sutured closed to a new convex polyhedron via Alexandrov's Gluing Theorem. In…

Edge polytopes is a class of interesting polytope with rich algebraic and combinatorial properties, which was introduced by Ohsugi and Hibi. In this papar, we follow a previous study on cutting edge polytopes by Hibi, Li and Zhang. Instead…