An algorithmic study of manufacturing paperclips and other folded structures.

DOI10.1016/S0925-7721(02)00133-5zbMath1038.68051MaRDI QIDQ1873158

Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell

Publication date: 19 May 2003

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

ManufacturingNP-hardNP-completePolygonsProcess planningFoldingLinkagesWire bending

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

When can you fold a map?

Uses Software

• Mathematica
• UnfoldPolytope

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonoverlap of the star unfolding
• Reconfiguring closed polygonal chains in Euclidean \(d\)-space
• A note on reconfiguring tree linkages: Trees can lock
• Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami
• Ununfoldable polyhedra with convex faces
• Folding rulers inside triangles
• Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
• Computational Geometry Column 33
• Locked and unlocked polygonal chains in three dimensions

This page was built for publication: An algorithmic study of manufacturing paperclips and other folded structures.