相关论文: Hinged-rulers fold in $2-\Theta(\frac{1}{2^{n/4}})…

In 1985 Hopcroft, Joseph and Whitesides showed it is NP-complete to decide whether a carpenter's ruler with segments of given positive lengths can be folded into a line of at most a given length, such that the folded hinges alternate…

At CCCG '21 O'Rourke proposed a variant of Hopcroft, Josephs and Whitesides' (1985) NP-complete problem {\sc Ruler Folding}, which he called {\sc Ruler Wrapping} and for which all folds must be 180 degrees in the same direction. Gagie,…

We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…

A flip in a plane spanning tree $T$ is the operation of removing one edge from $T$ and adding another edge such that the resulting structure is again a plane spanning tree. For trees on a set of points in convex position we study two…

In the present paper we give a historical account -ranging from classical to modern results- of the problem of rolling two Riemannian manifolds one on the other, with the restrictions that they cannot instantaneously slip or spin one with…

We study algorithmic aspects of bending wires and sheet metal into a specified structure. Problems of this type are closely related to the question of deciding whether a simple non-self-intersecting wire structure (a carpenter's ruler) can…

A ribbon is a two-dimensional object with one-dimensional properties which is related with geometry, robotics and molecular biology. A folded ribbon structure provides a complex structure through a series of folds. We focus on a folded…

In this paper, we consider two cases of rolling of one smooth connected complete Riemannian manifold $(M,g)$ onto another one $(\hM,\hg)$ of equal dimension $n\geq 2$. The rolling problem $(NS)$ corresponds to the situation where there is…

The statistical mechanics of polymer loops entangled in the two-dimensional array of randomly distributed obstacles of infinite length is discussed. The area of the loop projected to the plane perpendicular to the obstacles is used as a…

We introduce a computational origami problem which we call the segment folding problem: given a set of $n$ line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding…

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…

A (multi)set of segments in the plane may form a TSP tour, a matching, a tree, or any multigraph. If two segments cross, then we can reduce the total length with the following flip operation. We remove a pair of crossing segments, and…

If $(M,g)$ and $(\hM,\hg)$ are two smooth connected complete oriented Riemannian manifolds of dimensions $n$ and $\hn$ respectively, we model the rolling of $(M,g)$ onto $(\hM,\hg)$ as a driftless control affine systems describing two…

Using results on the topology of moduli space of polygons [Jaggi, 92; Kapovich and Millson, 94], it can be shown that for a planar robot arm with $n$ segments there are some values of the base-length, $z$, at which the configuration space…

This paper invented a new rolling control mechanism of two section articulated-wing ornithopter, which is analogues to aileron control in plane, however, similar control mechanism leads to opposite result, indicating the ornithopter…

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;…

In the rod and hole paradox as described by Rindler (1961 Am. J. Phys. 29 365-6), a rigid rod moves at high speed over a table towards a hole of the same size. Observations from the inertial frames of the rod and slot are widely different.…

A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection of all edge-to-edge gluings of n congruent copies of a…

Molecular robotics is challenging, so it seems best to keep it simple. We consider an abstract molecular robotics model based on simple folding instructions that execute asynchronously. Turning Machines are a simple 1D to 2D folding model,…

The paperfolding sequences form an uncountable class of infinite sequences over the alphabet $\{ -1, 1 \}$ that describe the sequence of folds arising from iterated folding of a piece of paper, followed by unfolding. In this note we observe…