Locked and unlocked polygonal chains in three dimensions
From MaRDI portal
Publication:5953071
DOI10.1007/S00454-001-0038-7zbMATH Open0988.68202OpenAlexW2022467326MaRDI QIDQ5953071FDOQ5953071
Authors: Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, S. Robbins, Ileana Streinu, Godfried Toussaint, Sue Whitesides 
Publication date: 22 July 2002
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-001-0038-7
Recommendations
Cited In (20)
- A 2-chain can interlock with an open 10-chain
- Spaces of polygons degenerated to segments
- Interlocked open and closed linkages with few joints.
- Extremal reaches in polynomial time
- An algorithmic study of manufacturing paperclips and other folded structures.
- When can a net fold to a polyhedron?
- The Erdős--Nagy theorem and its ramifications
- Pole dancing: 3D morphs for tree drawings
- On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees
- Title not available (Why is that?)
- Reconfiguring closed polygonal chains in Euclidean \(d\)-space
- An energy-driven approach to linkage unfolding
- The Reachability Problem in a Concave Region: A New Context
- Algorithms and Computation
- ON UNFOLDING LATTICE POLYGONS/TREES AND DIAMETER-4 TREES
- Title not available (Why is that?)
- Locked and unlocked chains of planar shapes
- On the stretch factor of polygonal chains
- Preprocessing chains for fast dihedral rotations is hard or even impossible.
- Polygonal chains cannot lock in 4D
This page was built for publication: Locked and unlocked polygonal chains in three dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953071)
