Tonan Kamata

According to our database, Tonan Kamata authored at least 12 papers between 2020 and 2026.

Collaborative distances:

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

2026

Dudeney's Dissection Is Optimal.

Erik D. Demaine, Tonan Kamata, Ryuhei Uehara

Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

A Bookworm Climbs up the Polynomial Hierarchy: Meta-Restoration Complexity in Arithmetic Puzzles.

Brynmor Chapman, Lily Chung, Erik D. Demaine, Yota Irino, Della H. Hendrickson, Tonan Kamata, Ryuhei Uehara

Proceedings of the 13th International Conference on Fun with Algorithms, 2026

2025

All Polyhedral Manifolds are Connected by a 2-Step Refolding.

Lily Chung, Erik D. Demaine, Jenny Diomidova, Tonan Kamata, Jayson Lynch, Ryuhei Uehara, Hanyu Alice Zhang

J. Inf. Process., 2025

Computational Complexity of One-Dimensional Origami with Constraints on Thickness at Creases.

Junnosuke Hoshido, Tonan Kamata, Tsutomu Ansai, Ryuhei Uehara

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2025

The Number of Non-overlapping Unfoldings in Convex Polyhedra.

Takumi Shiota, Yudai Enomoto, Masashi Gorobe, Takashi Horiyama, Tonan Kamata, Toshiki Saitoh, Ryuhei Uehara

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

2023

Efficient Folding Algorithms for Convex Polyhedra.

Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara

Discret. Comput. Geom., December, 2023

Any platonic solid can transform to another by <i>O</i>(1) refoldings.

Erik D. Demaine, Martin L. Demaine, Jenny Diomidova, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang

Comput. Geom., August, 2023

Overlapping of Lattice Unfolding for Cuboids.

Takumi Shiota, Tonan Kamata, Ryuhei Uehara

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022

Computational Complexity of One-Dimensional Origami and Its Application to Digital Signature.

Junnosuke Hoshido, Tonan Kamata, Tsutomu Ansai, Ryuhei Uehara

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

Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra.

Elena Arseneva, Erik D. Demaine, Tonan Kamata, Ryuhei Uehara

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

2021

Any Regular Polyhedron Can Transform to Another by O(1) Refoldings.

Erik D. Demaine, Martin L. Demaine, Jenny Diomidova, Tonan Kamata, Ryuhei Uehara, Hanyu Alice Zhang

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

2020

Efficient Folding Algorithms for Regular Polyhedra.

Tonan Kamata, Akira Kadoguchi, Takashi Horiyama, Ryuhei Uehara

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020