2013Unpublished venueOpen access

Refold rigidity of convex polyhedra

Erik D. Demaine, Martin L. Demaine, Jin‐ichi Itoh, Anna Lubiw, Chiê Nara, Joseph O’Rourke

Open full text 5 citations

Abstract

We show that every convex polyhedron may be unfolded to one planar piece, and then refolded to a different convex polyhedron. If the unfolding is restricted to cut only edges of the polyhedron, then we show that many regular and semi-regular polyhedra are “edge-unfold rigid ” in the sense that each of their unfoldings may only fold back to the original. For example, all of the 43,380 edge unfoldings of a dodecahedron may only fold back to the dodecahedron. We begin the exploration of which polyhedra are edge-unfold rigid, demonstrating infinite rigid classes through perturbations, and identifying one infinite nonrigid class: tetrahedra. (This is the full version of the 4-page abstract. [6Feb12]) 1

About this research paper

What this paper is about

We show that every convex polyhedron may be unfolded to one planar piece, and then refolded to a different convex polyhedron. If the unfolding is restricted to cut only edges of the polyhedron, then we show that many regular and semi-regular polyhedra are “edge-unfold rigid ” in the sense that each of their unfoldings may only fold back to the original. For example, all of the 43,380 edge unfoldings of a dodecahedron may only fold back to the dodecahedron. We begin the exploration of which polyhedra are edge-unfold rigid, demonstrating infinite rigid classes through perturbations, and identifying one infinite nonrigid class: tetrahedra. (This is the full version of the 4-page abstract. [6Feb12]) 1

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We show that every convex polyhedron may be unfolded to one planar piece, and then refolded to a different convex polyhedron. If the unfolding is restricted to cut only edges of the polyhedron, then we show that many regular and semi-regular polyhedra are “edge-unfold rigid ” in the sense that each of their unfoldings may only fold back to the original. For example, all of the 43,380 edge unfoldings of a dodecahedron may only fold back to the dodecahedron. We begin the exploration of which polyhedra are edge-unfold rigid, demonstrating infinite rigid classes through perturbations, and identifying one infinite nonrigid class: tetrahedra. (This is the full version of the 4-page abstract. [6Feb12]) 1

Key concepts: Polyhedron, Dodecahedron, Regular polygon, Convex polytope, Combinatorics, Enhanced Data Rates for GSM Evolution, Rigidity (electromagnetism), Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Refold rigidity of convex polyhedra — Research Paper | ScholarLens