Related papers: Dihedral angles and orthogonal polyhedra

We study the problem of folding a polyomino $P$ into a polycube $Q$, allowing faces of $Q$ to be covered multiple times. First, we define a variety of folding models according to whether the folds (a) must be along grid lines of $P$ or can…

Simultaneous diagonal flips in plane triangulations are investigated. It is proved that every $n$-vertex triangulation with at least six vertices has a simultaneous flip into a 4-connected triangulation, and that it can be computed in O(n)…

A polyhedral surface~$\mathcal{C}$ in $\mathbb{R}^3$ with convex polygons as faces is a side-contact representation of a graph~$G$ if there is a bijection between the vertices of $G$ and the faces of~$\mathcal{C}$ such that the polygons of…

Given vertex valencies admissible for a self-dual polyhedral graph, we describe an algorithm to explicitly construct such a polyhedron. Inputting in the algorithm permutations of the degree sequence can give rise to non-isomorphic graphs.…

We classify all edge-to-edge spherical isohedral 4-gonal tilings such that the skeletons are pseudo-double wheels. For this, we characterize these spherical tilings by a quadratic equation for the cosine of an edge-length. By the…

The diameter of the graph of a $d$-dimensional polyhedron with $n$ facets is at most $n^{\log d+2}$

Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…

We examine implications of angles having their own dimension, in the same sense as do lengths, masses, {\it etc.} The conventional practice in scientific applications involving trigonometric or exponential functions of angles is to assume…

It is a well known phenomenon that many classical minimal surfaces in Euclidean space also exist with higher dihedral symmetry. More precisely, these surfaces are solutions to free boundary problems in a wedge bounded by two vertical planes…

Skeletal polyhedra and polygonal complexes are finite or infinite periodic structures in 3-space with interesting geometric, combinatorial, and algebraic properties. These structures can be viewed as finite or infinite periodic graphs…

We classify the faces of copositive and completely positive cones over a second-order cone and investigate their dimension and exposedness properties. Then we compute two parameters related to chains of faces of both cones. At the end, we…

Motivated by categorical representation theory, we define the wiggly complex, whose vertices are arcs wiggling around $n+2$ points on a line, and whose faces are sets of wiggly arcs which are pairwise pointed and non-crossing. The wiggly…

When the sequence of regular polygons with consecutively increasing numbers of sides is joined edge-to-edge in a single direction while minimizing bending, the resulting structure assumes the shape of a logarithmic spiral. This paper proves…

A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…

A famous problem in discrete geometry is to find all monohedral plane tilers, which is still open to the best of our knowledge. This paper concerns with one of its variants that to determine all convex polyhedra whose every cross-section…

The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed…

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…

A rational spherical triangle is a triangle on the unit sphere such that the lengths of its three sides and its area are rational multiples of $\pi$. Little and Coxeter have given examples of rational spherical triangles in 1980s. In this…

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…

Two important classes of three-dimensional elements in computational meshes are hexahedra and tetrahedra. While several efficient methods exist that convert a hexahedral element to a tetrahedral elements, the existing algorithm for…