• Corpus ID: 3036625

Locked and unlocked polygonal chains in 3D

@article{Biedl1998LockedAU,
  title={Locked and unlocked polygonal chains in 3D},
  author={Therese C. Biedl and Erik D. Demaine and Martin L. Demaine and Sylvain Lazard and Anna Lubiw and Joseph O'Rourke and Mark H. Overmars and Steven M. Robbins and Ileana Streinu and Godfried T. Toussaint and Sue Whitesides},
  journal={ArXiv},
  year={1998},
  volume={cs.CG/9910009}
}
In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of segments in such a manner that both the length of each link and the simplicity of the chain are maintained throughout the movement. The analogous concept for closed chains is convexification: reconfiguration to a planar convex polygon. Chains that cannot be straightened or convexified are called… 
View on ACM
arxiv.org
55 Citations
Highly Influential Citations
1
Background Citations
23
Methods Citations
4
Results Citations
2

Figures from this paper

55 Citations

C G ] 8 O ct 1 99 9 Locked and Unlocked Polygonal Chains in 3 D ∗ T . Biedl

It is said that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of segments in such a manner that both the length of each link and the simplicity of the chain are maintained throughout the movement.

Computational Polygonal Entanglement Theory

In this paper we are concerned with motions for untangling polygonal linkages (chains, polygons and trees) in 2 and 3 dimensions. We say that an open, simple polygonal chain can be straightened if it…

Locked and Unlocked Polygonal Chains in Three Dimensions

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.

Polygonal chains cannot lock in 4d

Geometric Restrictions on Producible Polygonal Protein Chains

It is proved that the producible chains are rare in the following technical sense: if a class of chains has a locked configuration, then the probability that a random configuration of a random chain is producible approaches zero geometrically as n → ∞.

Straightening polygonal arcs and convexifying polygonal cycles

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.

Reconfigurations of polygonal structures

This thesis contains new results on the subject of polygonal structure reconfiguration. Specifically, the types of structures considered here are polygons, polygonal chains, triangulations, and…

On reconfiguring tree linkages: Trees can lock

It is proved that an N-link tree can have 2 (N) equivalence classes of configurations, and it is shown that there are trees with two simple configurations that are not connected by a motion that preserves simplicity throughout the motion.

Reconfiguring convex polygons

Grasping and folding knots

This work shows that a number of grasp points that is linear in the number of crossings in a knot diagram is sufficient to immobilize string in a polygonal shape with the topology of an arbitrary knot, or to fold or unfold the knot from a straight configuration.
...

References

SHOWING 1-10 OF 37 REFERENCES

Polygonal chains cannot lock in 4d

Reconfiguring closed polygonal chains in Euclideand-space

It is shown that in three or more dimensions, reconfiguration is always possible, but that in dimension two this is not the case, and anO(n) algorithm is given for determining whether it is possible to move between two given configurations of a closed chain in the plane.

Folding rulers inside triangles

It is shown thatl-rulers confined inside an equilateral triangle of side 1 exhibit the following surprising alternation property: there are three values ofx1≈0.483,x2=0.5, andx3≈ 0.866 such that all configurations ofn-linkl- rulers fold.

Convexifying star-shaped polygons

It is shown that all star-shaped simple polygons can be transformed into convex polygons by continuous motions during which the edges remain rigid and the polygon remains star- shaped and simple.

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

On the geometry of the planar 4-bar mechanism

The paper seeks to elucidate the geometry of a simple engineering mechanism, comprising four bars smoothly jointed together to form a movable quadrilateral with one fixed side. The configurations of…

The Erdös-Nagy theorem and its ramifications

Movement Problems for 2-Dimensional Linkages

This paper results show that a planar linkage can be constrained to stay inside a bounded region whose boundary consists of straight lines by the addition of a polynomial number of new links.

Drawing Nice Projections of Objects in Space

It is shown that an object always admits a regular projection and that such a projection can be obtained in O(n2) time and space or inO(n3)Time and linear space, and when the objects are polygons and trees in space, they are consideredmonotonic projections, i.e., projections such that every path from the root of the tree to every leaf is monotonic in a common direction on the projection plane.

A geometric investigation of reach

This work offers two new solutions to the reach problem-an analytic solution for the special case of singly redundant chains of the type exemplified by human arms and legs, and a solution for chains of arbitrary length which makes use of workspace descriptions.