An energy-driven approach to linkage unfolding

@inproceedings{Cantarella2004AnEA,
  title={An energy-driven approach to linkage unfolding},
  author={Jason H. Cantarella and Erik D. Demaine and Hayley N. Iben and James F. O'Brien},
  booktitle={SCG '04},
  year={2004}
}
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a "repulsive" energy function. This algorithm has several advantages over previous methods. (1) The output motion is represented explicitly and exactly as a piecewise-linear curve in angle space. As a consequence, an exact snapshot of the linkage at any time can be extracted from the output in strongly polynomial time (on a real RAM supporting arithmetic, radicals… Expand
Invertible Paradoxic Loop Structures for Transformable Design
TLDR
An interactive tool compatible with existing software is presented to design ring structures with a paradoxic mobility, which are self‐collision‐free over the complete motion cycle, and is demonstrated in the context of an architectural and artistic application studied in a master‐level studio course. Expand
On the unfolding of simple closed curves
We show that every rectifiable simple closed curve in the plane can be continuously deformed into a convex curve in a motion which preserves arc length and does not decrease the Euclidean distanceExpand
Energy-Based Pose Unfolding and Interpolation for 3D Articulated Characters
TLDR
Results of controlling a 3D articulated human body model by using a repulsive energy function are shown and it is shown that intersection free movements can be synthesized even when starting from complex postures that the limbs are intertwined with each other. Expand
Refolding Planar Polygons
TLDR
This paper describes an algorithm for generating a guaranteed intersection-free interpolation sequence between any pair of compatible polygons that builds on prior results from linkage unfolding, and allows additional control by accommodating a set of algebraic constraints that can be weakly enforced throughout the interpolation sequences. Expand
Refolding planar polygons
This paper describes an algorithm for generating a guaranteed-intersection-free interpolation sequence between any pair of compatible polygons. Our algoithm builds on prior results from linkageExpand
Refolding planar polygons
This paper describes an algorithm for generating a guaranteed intersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prior results from linkageExpand
On folding and unfolding with linkages and origami
TLDR
A self-touching version of the celebrated Expansive Carpenter’s Rule Theorem is proved, which proves polyhedra are hard to edge unfold and it is NP-hard to decide whether a polyhedron may be cut along edges and unfolded into a non-overlapping net. Expand
Locked and Unlocked Chains of Planar Shapes
TLDR
It is shown that isosceles triangles with any desired apex angle <90° admit locked chains, which is precisely the threshold beyond which the slender property no longer holds, and that a surprisingly general family of planar shapes, called slender adornments, guarantees universal foldability. Expand
Locked and unlocked chains of planar shapes
TLDR
The goal is to characterize the familes of planar shapes that admit locked chains, where some configurations cannot be reached by continuous reconfiguration without self-intersection, and which families ofPlanar shapes guarantee universal foldability, where every chain is guaranteed to have a connected configuration space. Expand
On Unfolding Lattice Polygons/Trees and Diameter-4 Trees
  • S. Poon
  • Mathematics, Computer Science
  • COCOON
  • 2006
TLDR
This paper considers the problems of straightening polygonal trees and convexifying polygons by continuous motions such that rigid edges can rotate around vertex joints and no edge crossings are allowed and shows that two special classes of diameter-4 trees in two dimensions can be straightened. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 23 REFERENCES
A combinatorial approach to planar non-colliding robot arm motion planning
  • I. Streinu
  • Mathematics, Computer Science
  • Proceedings 41st Annual Symposium on Foundations of Computer Science
  • 2000
TLDR
A combinatorial approach to plan noncolliding motions for a polygonal bar-and-joint framework based on a novel class of one-degree-of-freedom mechanisms induced by pseudo triangulations of planar point sets that yields very efficient deterministic algorithms for a category of robot arm motion planning problems with many degrees of freedom. Expand
Straightening polygonal arcs and convexifying polygonal cycles
TLDR
It is proved that the linkage can be continuously moved so that the arcs become straight, the cycles become convex, and no bars cross while preserving the bar lengths. Expand
Locked and Unlocked Polygonal Chains in Three Dimensions
TLDR
The main result is an algorithmic proof that any simple closed chain that initially takes the form of a planar polygon can be made convex in three dimensions. Expand
Properties of Knot Energies
Energy functions on knots are continuous and scale-invariant functions defined from knot conformations into non-negative real numbers. The infimum of an energy function is an invariant which definesExpand
Polygonal chains cannot lock in 4d
We prove that, in all dimensions d⩾4, every simple open polygonal chain and every tree may be straightened, and every simple closed polygonal chain may be convexified. These reconfigurations can beExpand
The complexity of (un)folding
TLDR
It is shown that deciding reconfigurability for trees in two dimensions and for chains in three dimensions is PSPACE-complete. Expand
Topology and geometry in polymer science
1. Entanglement Complexity of Polymers.- Entanglements of polymers.- Entropic exponents of knotted lattice polygons.- The torsion of three-dimensional random walk.- 2. Knot Energies.- Self-repellingExpand
Circles minimize most knot energies
Abstract We define a new class of knot energies (known as renormalization energies ) and prove that a broad class of these energies are uniquely minimized by the round circle. Most of O'Hara's knotExpand
NONTRIVIAL EMBEDDINGS OF POLYGONAL INTERVALS AND UNKNOTS IN 3-SPACE
We consider embedding classes of polygonal intervals and circles with fixed edge lengths. We classify all embeddings of polygonal lines of five segments, finding that this space has three connectedExpand
Solving convex programs by random walks
TLDR
A simple new algorithm for convex optimization based on sampling by a random walk is presented, which solves for a natural generalization of the problem. Expand
...
1
2
3
...