activity
20132022
most citedRigid Origami Vertices: Conditions and Forcing Sets

20 citations · 60 across the 17 of their papers we have counts for

collaborators

17 papers

cond-mat.soft2022★ 1 cited

Explicit kinematic equations for degree-4 rigid origami vertices, Euclidean and non-Euclidean

Riccardo Foschi, Thomas C. Hull, Jason S. Ku

We derive new algebraic equations for the folding angle relationships in completely general degree-four rigid-foldable origami vertices, including both Euclidean (developable) and…

math.CO2022

Maximal origami flip graphs of flat-foldable vertices: properties and algorithms

Thomas C. Hull, Manuel Morales, Sarah Nash +1

Flat origami studies straight line, planar graphs drawn on a region that can act as crease patterns to map, or fold, into in a w…

math.MG2021★ 17 cited

Rigid folding equations of degree-6 origami vertices

Johnna Farnham, Thomas C. Hull, Aubrey Rumbolt

Rigid origami, with applications ranging from nano-robots to unfolding solar sails in space, describes when a material is folded along straight crease line segments while keeping t…

math.CO2019

Face flips in origami tessellations

Hugo A. Akitaya, Vida Dujmovi, David Eppstein +3

Given a flat-foldable origami crease pattern (a straight-line drawing of a planar graph on a region of the plane) with a mountain-valley (MV) assignment …

math.CO2019

Counting locally flat-foldable origami configurations via 3-coloring graphs

Alvin Chiu, William Hoganson, Thomas C. Hull +1

Origami, where two-dimensional sheets are folded into complex structures, is proving to be rich with combinatorial and geometric structure, most of which remains to be fully unders…

cs.CG2018★ 6 cited

Rigid Foldability is NP-Hard

Hugo Akitaya, Erik D. Demaine, Takashi Horiyama +3

In this paper, we show that deciding rigid foldability of a given crease pattern using all creases is weakly NP-hard by a reduction from Partition, and that deciding rigid foldabil…