Rigidity of Origami Universal Molecules

  • John C. Bowers
  • Ileana Streinu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7993)

Abstract

In a seminal paper from 1996 that marks the beginning of computational origami, R. Lang introduced TreeMaker, a method for designing origami crease patterns with an underlying metric tree structure. In this paper we address the foldability of paneled origamis produced by Lang’s Universal Molecule algorithm, a key component of TreeMaker.

We identify a combinatorial condition guaranteeing rigidity, resp. stability of the two extremal states relevant to Lang’s method: the initial flat, open state, resp. the folded origami base computed by Lang’s algorithm. The proofs are based on a new technique of transporting rigidity and flexibility along the edges of a paneled surface.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • John C. Bowers
    • 1
  • Ileana Streinu
    • 2
  1. 1.Department of Computer ScienceUniversity of MassachusettsAmherstUSA
  2. 2.Department of Computer ScienceSmith CollegeNorthamptonUSA

Personalised recommendations