Flattening single-vertex origami: The non-expansive case

DOI10.1016/J.COMGEO.2010.04.002zbMATH Open1207.52021arXiv1003.3490OpenAlexW2570222084MaRDI QIDQ991180FDOQ991180

Authors: Ileana Streinu, G. Panina 

Publication date: 2 September 2010

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

Abstract: A single-vertex origami is a piece of paper with straight-line rays called creases emanating from a fold vertex placed in its interior or on its boundary. The Single-Vertex Origami Flattening problem asks whether it is always possible to reconfigure the creased paper from any configuration compatible with the metric, to a flat, non-overlapping position, in such a way that the paper is not torn, stretched and, for rigid origami, not bent anywhere except along the given creases. Streinu and Whiteley showed how to reduce the problem to the carpenter's rule problem for spherical polygons. Using spherical expansive motions, they solved the cases of open < pi and closed <= 2pi spherical polygons. Here, we solve the case of open polygons with total length between [pi, 2pi), which requires non-expansive motions. Our motion planning algorithm works in a finite number of discrete steps, for which we give precise bounds depending on both the number of links and the angle deficit.

Full work available at URL: https://arxiv.org/abs/1003.3490

Recommendations

• Flattening single-vertex origami: the non-expansive case
• Single-Vertex Origami and Spherical Expansive Motions
• scientific article; zbMATH DE number 841580
• On the elementary single-fold operations of origami: reflections and incidence constraints on the plane
• Origami flat folded states and their moduli
• Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami
• Realization and connectivity of the graphs of origami flat foldings
• Realization and connectivity of the graphs of origami flat foldings
• scientific article; zbMATH DE number 871913
• Maximal origami flip graphs of flat-foldable vertices: properties and algorithms

zbMATH Keywords

origamifoldingspherical linkagecarpenter's rule problemexpansive motion

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Topological nonlinear incidence structures (51H15)

Cites Work

• Geometric folding algorithms. Linkages, origami, polyhedra
• Pseudo-triangulations -- a survey
• Single-Vertex Origami and Spherical Expansive Motions
• Acute triangulations of polygons
• Straightening polygonal arcs and convexifying polygonal cycles

Cited In (9)

• Single-Vertex Origami and Spherical Expansive Motions
• Locked and unlocked smooth embeddings of surfaces
• Polygons with prescribed angles in 2D and 3D
• Rigid Origami Vertices: Conditions and Forcing Sets
• Polygons with Prescribed Angles in 2D and 3D
• Flattening single-vertex origami: the non-expansive case
• Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns
• Lang's universal molecule algorithm
• Flat folding an unassigned single-vertex complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) without flat angles

This page was built for publication: Flattening single-vertex origami: The non-expansive case

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