Thomas C. Hull

According to our database, Thomas C. Hull authored at least 20 papers between 2011 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

The Origami flip graph of the 2⨉n Miura-ori.

Lumi Christensen, Thomas C. Hull, Emma O'Neil, Valentina Pappano, Natalya Ter-Saakov, Kacey Yang

CoRR, June, 2025

The Stamp Folding Problem From a Mountain-Valley Perspective: Enumerations and Bounds.

Thomas C. Hull, Adham Ibrahim, Jacob Paltrowitz, Natalya Ter-Saakov, Grace Wang

CoRR, March, 2025

On random locally flat-foldable origami.

Thomas C. Hull, Marcus Michelen, Corrine Yap

CoRR, February, 2025

A rigid origami elliptic-hyperbolic vertex duality.

Thomas C. Hull

CoRR, January, 2025

The Stamp Folding Problem From a Mountain-Valley Perspective.

Thomas C. Hull, Adham Ibrahim, Jacob Paltrowitz, Natalya Ter-Saakov, Grace Wang

Discret. Math. Theor. Comput. Sci., 2025

Quasigeodesics on the Cube.

MIT CompGeom Group, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Thomas C. Hull, Anna Lubiw, Jayson Lynch, Klara Mundilova, Chie Nara, Joseph O'Rourke, Frederick Stock, Josef Tkadlec, Ryuhei Uehara

Proceedings of the 37th Canadian Conference on Computational Geometry (CCCG 2025), 2025

2023

Flat origami is Turing Complete.

Thomas C. Hull, Inna Zakharevich

CoRR, 2023

2022

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

Thomas C. Hull, Manuel Morales, Sarah Nash, Natalya Ter-Saakov

J. Graph Algorithms Appl., 2022

Quasi-Twisting Convex Polyhedra.

Joseph O'Rourke, Anna Lubiw, Ryuhei Uehara, Chie Nara, Thomas C. Hull, Klara Mundilova, Josef Tkadlec

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

Counting Locally Flat-Foldable Origami Configurations Via 3-Coloring Graphs.

Alvin Chiu, William Hoganson, Thomas C. Hull, Sylvia Wu

Graphs Comb., 2021

Folding Points to a Point and Lines to a Line.

Hugo A. Akitaya, Brad Ballinger, Erik D. Demaine, Thomas C. Hull, Christiane Schmidt

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Rigid foldability is NP-hard.

Hugo A. Akitaya, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi

J. Comput. Geom., 2020

Face flips in origami tessellations.

Hugo A. Akitaya, Vida Dujmovic, David Eppstein, Thomas C. Hull, Kshitij Jain, Anna Lubiw

J. Comput. Geom., 2020

2017

Minimal forcing sets for 1D origami.

Mirela Damian, Erik D. Demaine, Muriel Dulieu, Robin Y. Flatland, Hella Hoffman, Thomas C. Hull, Jayson Lynch, Suneeta Ramaswami

CoRR, 2017

2016

Rigid origami vertices: conditions and forcing sets.

Zachary Abel, Jason H. Cantarella, Erik D. Demaine, David Eppstein, Thomas C. Hull, Jason S. Ku, Robert J. Lang, Tomohiro Tachi

J. Comput. Geom., 2016

Coloring connections with counting mountain-valley assignments.

Thomas C. Hull

CoRR, 2016

2015

Minimum Forcing Sets for Miura Folding Patterns.

Brad Ballinger, Mirela Damian, David Eppstein, Robin Y. Flatland, Jessica Ginepro, Thomas C. Hull

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Box Pleating is Hard.

Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Takashi Horiyama, Thomas C. Hull, Jason S. Ku, Tomohiro Tachi, Ryuhei Uehara

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2014

Counting Miura-ori Foldings.

Jessica Ginepro, Thomas C. Hull

J. Integer Seq., 2014

2011

Solving Cubics With Creases: The Work of Beloch and Lill.

Thomas C. Hull

Am. Math. Mon., 2011