相关论文: A system for constructing relatively small polyhed…

We show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previous such result used exponentially many cuts. More precisely,…

We propose a novel computational framework for modeling and simulating origami structures. In this framework, bilinear solid-shell elements are employed to model the origami panels while crease folding is considered through the angle…

By taking quotients of a certain tiling of hyperbolic plane / space by certain group actions, we obtain geometric polyhedra / cellulations with interesting symmetries and incidence structure.

Rigid origami is a branch of origami with great potential in engineering applications to deal with rigid-panel folding. One of the challenges is to compactly fold the polyhedra made from rigid facets with a single degree of freedom. In this…

We introduce polyhedral cones associated with $m$-hemimetrics on $n$ points, and, in particular, with $m$-hemimetrics coming from partitions of an $n$-set into $m+1$ blocks. We compute generators and facets of the cones for small values of…

A transitive decomposition of a graph is a partition of the edge or arc set giving a set of subgraphs which are preserved and permuted transitively by a group of automorphisms of the graph. In this paper we give some background to the study…

Self-assembly is one of the most promising strategies for making functional materials at the nanoscale, yet new design principles for making self-limiting architectures, rather than spatially unlimited periodic lattice structures, are…

Given a graph G, we construct a convex polytope whose face poset is based on marked subgraphs of G. Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of…

Traditional origami structures can be continuously deformed back to a flat sheet of paper, while traditional kirigami requires glue or seams in order to maintain its rigidity. In the former, non-trivial geometry can be created through…

We construct a polygonal spiral by arranging a sequence of regular $n$-gons such that each $n$-gon shares a specified side and vertex with the $(n+1)$-gon in the construction. By offering flexibility for determining the size of each $n$-gon…

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…

We construct affine algebras with an arbitrary amount of simple modules of each dimension.

We prove a version of Poincar\'e's polyhedron theorem whose requirements are as local as possible. New techniques such as the use of discrete groupoids of isometries are introduced. The theorem may have a wide range of applications and can…

Here we describe an ultra-low-cost origami-based approach for large-scale manufacturing of microscopes, specifically demonstrating brightfield, darkfield, and fluorescence microscopes. Merging principles of optical design with origami…

We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common…

One-dimensional slender bodies can be deformed or shaped into spatially complex curves relatively easily due to their inherent compliance. However, traditional methods of fabricating complex spatial shapes are cumbersome, prone to error…

Simple polyhedra are $2$-dimensional polyhedra and important objects in low-dimensional geometry and in the applications of {\it fold} maps, defined as smooth maps regarded as higher dimensional variants of Morse functions. For example,…

Origami describes rules for creating folded structures from patterns on a flat sheet, but does not prescribe how patterns can be designed to fit target shapes. Here, starting from the simplest periodic origami pattern that yields one…

There are many examples of optimization problems whose associated polyhedra can be described much nicer, and with way less inequalities, by projections of higher dimensional polyhedra than this would be possible in the original space.…