相关论文: When Can You Fold a Map?

We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…

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…

Rigid origami, with applications ranging from nano-robots to unfolding solar sails in space, describes when a material is folded along straight crease line segments while keeping the regions between the creases planar. Prior work has found…

We introduce the rotation unfolding of the folding map of a surface in $\mathbb{R}^3$, and investigate its $\mathcal{A}$-vesality. The rotation unfolding is a 2-parameter unfolding and can be considered as a subfamily of the folding family,…

We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

Fold maps are smooth maps at each singular point of which it is represented as the product map of a Morse function and the identity map. Round fold maps are, in short, such maps the sets of all singular points of which are embedded…

Consider a graph drawn on a surface (for example, the plane minus a finite set of obstacle points), possibly with crossings. We provide an algorithm to decide whether such a drawing can be untangled, namely, if one can slide the vertices…

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…

This paper shows a cut along a crease on an origami sheet makes simple modeling of popular traditional basic folds such as a squash fold in computational origami. The cut operation can be applied to other classical folds and significantly…

In this paper we study maps (curved flats) into symmetric spaces which are tangent at each point to a flat of the symmetric space. Important examples of such maps arise from isometric immersions of space forms into space forms via their…

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…

We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…

Flaps can be detached from a thin film glued on a solid substrate by tearing and peeling. For flat substrates, it has been shown that these flaps spontaneously narrow and collapse in pointy triangular shapes. Here we show that various…

Origami crease patterns are folding paths that transform flat sheets into spatial objects. Origami patterns with a single degree of freedom (DOF) have creases that fold simultaneously. More often, several substeps are required to…

Fold-and-cut theorem claims the possibility to cut out from a sheet a set of straight-line drawing using only one cut of scissors, without producing any other cut in the sheet and separating all the figures at the same time, just by folding…

Round fold maps are smooth maps on closed manifolds which are locally represented as the product maps of Morse functions and identity maps on open disks and whose singularity is realized as concentrically embedded spheres. The author…

Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…

The definition of $1$-planar graphs naturally extends graph planarity, namely a graph is $1$-planar if it can be drawn in the plane with at most one crossing per edge. Unfortunately, while testing graph planarity is solvable in linear time,…

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…