Locked and unlocked polygonal chains in three dimensions

DOI10.1007/s00454-001-0038-7zbMath0988.68202OpenAlexW2022467326MaRDI QIDQ5953071

No author found.

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

zbMATH Keywords

polygonal chains

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (9)

An algorithmic study of manufacturing paperclips and other folded structures. ⋮ ON UNFOLDING LATTICE POLYGONS/TREES AND DIAMETER-4 TREES ⋮ Interlocked open and closed linkages with few joints. ⋮ On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees ⋮ Unnamed Item ⋮ When can a net fold to a polyhedron? ⋮ The Erdős--Nagy theorem and its ramifications ⋮ Pole Dancing: 3D Morphs for Tree Drawings ⋮ Spaces of polygons degenerated to segments

This page was built for publication: Locked and unlocked polygonal chains in three dimensions