Universality of polyhedral linkages

DOI10.1007/S13366-025-00813-XMaRDI QIDQ7314293zbMATH OpenFDO

Authors Robert Miranda

Publication date 14 August 2026

Published in Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S13366-025-00813-X

Mathematics Subject Classification ID

Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Cites work

• A survey of folding and unfolding in computational geometry
• scientific article; zbMATH DE number 1341082 (Why is no real title available?)
• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• Locked and unlocked polygonal chains in three dimensions
• NONTRIVIAL EMBEDDINGS OF POLYGONAL INTERVALS AND UNKNOTS IN 3-SPACE
• On an general method of describing plane curves of the \(n\)-th degree by linkwork.
• On rigid origami I: piecewise-planar paper with straight-line creases
• Polygonal chains cannot lock in 4D
• Polyhedral Linkages
• Straightening polygonal arcs and convexifying polygonal cycles
• Universality theorems for configuration spaces of planar linkages
• Who needs crossings? Hardness of plane graph rigidity

This page was built for publication: Universality of polyhedral linkages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314293)