Locked and unlocked polygonal chains in three dimensions
From MaRDI portal
Publication:5953071
Recommendations
Cited in
(21)- A 2-chain can interlock with an open 10-chain
- Spaces of polygons degenerated to segments
- Interlocked open and closed linkages with few joints.
- Locked and unlocked smooth embeddings of surfaces
- An algorithmic study of manufacturing paperclips and other folded structures.
- Extremal reaches in polynomial time
- 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
- Reconfiguring closed polygonal chains in Euclidean \(d\)-space
- scientific article; zbMATH DE number 1877249 (Why is no real title available?)
- On the reconfiguration of chains
- 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
- 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)