相关论文: Continuous Flattening of All Polyhedral Manifolds …

We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…

Continuing results from JCDCGGG 2016 and 2017, we solve several new cases of the simple foldability problem -- deciding which crease patterns can be folded flat by a sequence of (some model of) simple folds. We give new efficient algorithms…

An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…

We study the problem of deciding whether a crease pattern can be folded by simple folds (folding along one line at a time) under the infinite all-layers model introduced by [Akitaya et al., 2017], in which each simple fold is defined by an…

We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequence of simple folds? There are several models of simple folds;…

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…

We show that every orthogonal polyhedron of genus at most 2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron edges). This is the first result on unfolding general orthogonal…

We prove several hardness results on folding origami crease patterns. Flat-folding finite crease patterns is fixed-parameter tractable in the ply of the folded pattern (how many layers overlap at any point) and the treewidth of an…

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In…

We present two universal hinge patterns that enable a strip of material to fold into any connected surface made up of unit squares on the 3D cube grid--for example, the surface of any polycube. The folding is efficient: for target surfaces…

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 prove that, for any two polyhedral manifolds $\mathcal P, \mathcal Q$, there is a polyhedral manifold $\mathcal I$ such that $\mathcal P, \mathcal I$ share a common unfolding and $\mathcal I,\mathcal Q$ share a common unfolding. In other…

An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a *net*, a connected planar piece with no overlaps. A *grid unfolding* allows additional cuts along grid edges induced by coordinate planes…

A notion of "radially monotone" cut paths is introduced as an effective choice for finding a non-overlapping edge-unfolding of a convex polyhedron. These paths have the property that the two sides of the cut avoid overlap locally as the cut…

We prove that, for any two polyhedral manifolds $\mathcal P,\mathcal Q$, there is a polyhedral manifold $\mathcal I$ such that $\mathcal P,\mathcal I$ share a common unfolding and $\mathcal I,\mathcal Q$ share a common unfolding. In other…

Ghomi proved that every convex polyhedron could be stretched via an affine transformation so that it has an edge-unfolding to a net [Gho14]. A net is a simple planar polygon; in particular, it does not self-overlap. One can view his result…

Curvature and mechanics are intimately connected for thin materials, and this coupling between geometry and physical properties is readily seen in folded structures from intestinal villi and pollen grains, to wrinkled membranes and…

Kokotsakis studied the following problem in 1932: Given is a rigid closed polygonal line (planar or non-planar), which is surrounded by a polyhedral strip, where at each polygon vertex three faces meet. Determine the geometries of these…

Given a polyhedral surface, assume that it is prohibited to change the shape and size of any face but it is permissible to change the dihedral angles between the faces. A polyhedral surface is said to be flexible if it is possible to change…

We construct examples of embedded flexible cross-polytopes in the spheres of all dimensions. These examples are interesting from two points of view. First, in dimensions 4 and higher, they are the first examples of embedded flexible…