Locked and Unlocked Polygonal Chains in 3D
T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, I. Streinu, G. Toussaint, S. Whitesides
Abstract
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 locked. While there are open chains in 3D that are locked, we show that if an open chain has a simple orthogonal projection onto some plane, it can be straightened. For closed chains, we show that there are unknotted but locked closed chains, and we provide an algorithm for convexifying a planar simple polygon in 3D with a polynomial number of moves.
Create a lesson
Related papers
Lunar Generalizations of the Euclidean Minimum Spanning Tree in the Plane and their Expected Costs
Ondřej Draganov, Herbert Edelsbrunner, Sophie Rosenmeier et al.
Quadratic Complexity of Voronoi Diagrams in R3 for Lines in a Single Ruling of a Regulus
Eunku Park
Sequential Euclidean tree construction with exponential memory: distributional performance and worst-case guarantees
Pedro M. M. de Castro
Computing an e-net of a closed hyperbolic surface
Vincent Delecroix, Vincent Despré, Camille Lanuel et al.
On Angle-optimization and Simplification of Degree-1 Homology Representatives
Emerson G. Escolar, Yuta Shimada
Riesz Energy Subset Selection in the Euclidean Plane is NP-Hard: A Reduction from the Ising Model on Planar Cubic Graphs
Michael Emmerich