Takashi Horiyama

Papers

Total Citations

H-Index

About

Takashi Horiyama is a leading figure in computational geometry and discrete algorithms, with a particular focus on the intersection of robotics and origami mathematics. His work on moving-target problems has redefined how we think about multi-robot coordination in dynamic environments. In his highly cited 2004 paper, "How to Collect Balls Moving in the Euclidean Plane," Horiyama tackled the challenge of using a limited number of robots to capture multiple moving objects, a problem distinct from the classic Moving-Target TSP. This research, which has accumulated over 11 citations across its versions, provides foundational insights for applications in surveillance, automated logistics, and drone swarm coordination. Horiyama is equally renowned for his groundbreaking contributions to computational origami. His 2018 paper, "Rigid Foldability is NP-Hard," demonstrated that determining whether a crease pattern can be folded without bending the paper is computationally intractable—a landmark result with over 10 citations. By proving both weak and strong NP-hardness for different variants, he settled a long-standing question in the field, influencing everything from deployable space structures to self-folding robotics. Horiyama’s work bridges theoretical computer science and practical engineering, making him a pivotal figure for students and researchers exploring the limits of algorithmic design in physical systems.