Computing Folded States

This is a technical talk about using a computer to fold origami. Existing programs like Oripa and Orihime compute folded states of a crease pattern by breaking up faces into congruent stacks of sub-faces and ordering them via slow exponential search. This talk will discuss a new method for computing folded states that does not sub-divide faces and can often infer an exponential number of output folded states in polynomial time. Some background in algorithms and computer science is suggested but not required.