Reconfiguring closed polygonal chains in Euclidean \(d\)-space

DOI10.1007/BF02574031zbMath0815.68120OpenAlexW2019452991MaRDI QIDQ1346132

William J. Lenhart, S. H. Whitesides

Publication date: 20 March 1995

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131350

zbMATH Keywords

reconfiguration

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (16)

An algorithmic study of manufacturing paperclips and other folded structures. ⋮ Folding rulers inside triangles ⋮ Connectivity and Irreducibility of Algebraic Varieties of Finite Unit Norm Tight Frames ⋮ On the reconfiguration of chains ⋮ The configuration space of a model for ringed hydrocarbon molecules ⋮ The configuration space of almost regular polygons ⋮ Minimum cost open chain reconfiguration ⋮ Configuration spaces of convex and embedded polygons in the plane ⋮ Motion planning and control of a planar polygonal linkage ⋮ When can a net fold to a polyhedron? ⋮ The Erdős--Nagy theorem and its ramifications ⋮ Homology of planar telescopic linkages ⋮ Polygonal chains cannot lock in 4D ⋮ Reconfiguring convex polygons ⋮ Convexifying polygons with simple projections ⋮ Free edge lengths in plane graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
• New algorithms for multilink robot arms
• Motions of a short-linked robot arm in a square
• Off-line dynamic maintenance of the width of a planar point set
• A combinatorial theorem in plane geometry
• Multidimensional Sorting
• On the Movement of Robot Arms in 2-Dimensional Bounded Regions

This page was built for publication: Reconfiguring closed polygonal chains in Euclidean \(d\)-space