Flattening single-vertex origami: The non-expansive case (Q991180)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Flattening single-vertex origami: The non-expansive case
scientific article

    Statements

    Flattening single-vertex origami: The non-expansive case (English)
    0 references
    0 references
    0 references
    2 September 2010
    0 references
    In the paper under review the authors answer in the affirmative a conjecture stated in [\textit{I. Streinu} and \textit{W. Whiteley}, Lecture Notes in Computer Science 3742, 161--173 (2005; Zbl 1136.52312)]: A single vertex origami whose fold vertex is placed on the boundary of the paper can always be reconfigured to the flat position with a non-colliding continuous motion. In the cited paper it is shown how to reduce the problem to the carpenter's rule problem for spherical polygons. Using spherical expansive motions, the cases of open \(< \pi \) and closed \(\leqslant 2\pi \) spherical polygons are solved. In the paper under review, the authors solve the case of open polygons with total length between \([\pi ,2\pi )\), which requires non-expansive motions. The proposed motion planning algorithm works in a finite number of discrete steps, for which the precise bounds depending on both the number of links and the angle deficit are given.
    0 references
    0 references
    origami
    0 references
    folding
    0 references
    expansive motion
    0 references
    carpenter's rule problem
    0 references
    spherical linkage
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references