We present a framework for studying protein folding pathways and potential landscapes
which is based on techniques recently developed in the robotics motion planning …

Consider a planar linkage, consisting of disjoint polygonal arcs and cycles of rigid bars
joined at incident endpoints (polygonal chains), with the property that no cycle surrounds …

We propose a combinatorial approach to plan noncolliding motions for a polygonal bar-and-
joint framework. Our approach yields very efficient deterministic algorithms for a category of …

In this paper, we present a framework for studying folding problems from a motion-planning
perspective. The version of the motion-planning problem we consider is that of determining …

This paper proposes a combinatorial approach to planning non-colliding trajectories for a
polygonal bar-and-joint framework with n vertices. It is based on a new class of simple …

We analyze the geometric structure and mechanical stability of a complete set of isostatic
and hyperstatic sphere packings obtained via exact enumeration. The number of …

We prove that all single-vertex origami shapes are reachable from the open flat state via
simple, non-crossing motions. We also consider conical paper, where the total sum of the …

Three open problems on folding/unfolding are discussed:(1) Can every convex polyhedron
be cut along edges and unfolded at to a single nonoverlapping piece?(2) Given gluing …

A Survey of Folding and Unfolding in Computational Geometry Page 1 Combinatorial and
Computational Geometry MSRI Publications Volume 52, 2005 A Survey of Folding and …

Folding and unfolding problems have been implicit since Albrecht Dürer in the early 1500's
[Dür77], but have not been studied extensively until recently. Over the past few years, there …