Jason S. Ku

According to our database, Jason S. Ku authored at least 20 papers between 2014 and 2021.

Collaborative distances:

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

2021

Continuous flattening of all polyhedral manifolds using countably infinite creases.

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jason S. Ku, Jayson Lynch, Jin-ichi Itoh, Chie Nara

Comput. Geom., 2021

2020

Rigid foldability is NP-hard.

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

J. Comput. Geom., 2020

Rectangular Unfoldings of Polycubes.

Martin L. Demaine, Robert A. Hearn, Junnosuke Hoshido, Jason S. Ku, Ryuhei Uehara

J. Inf. Process., 2020

Infinite All-Layers Simple Foldability.

Hugo A. Akitaya, Cordelia Avery, Joseph Bergeron, Erik D. Demaine, Justin Kopinsky, Jason S. Ku

Graphs Comb., 2020

Escaping a Polygon.

Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Jason S. Ku, Jayson Lynch

CoRR, 2020

Symmetric assembly puzzles are hard, beyond a few pieces.

Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno

Comput. Geom., 2020

Finding Closed Quasigeodesics on Convex Polyhedra.

Erik D. Demaine, Adam Hesterberg, Jason S. Ku

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2048 Without Merging.

Hugo A. Akitaya, Erik D. Demaine, Jason S. Ku, Jayson Lynch, Csaba D. Tóth

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

2019

Rectangular Unfoldings of Polycubes.

Martin L. Demaine, Robert A. Hearn, Jason S. Ku, Ryuhei Uehara

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Pachinko.

Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Ferran Hurtado, Jason S. Ku, Jayson Lynch

Comput. Geom., 2018

Toward Unfolding Doubly Covered n-Stars.

Hugo A. Akitaya, Brad Ballinger, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Irina Kostitsyna, Jason S. Ku, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

Negative Instance for the Edge Patrolling Beacon Problem.

Zachary Abel, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Matias Korman, Jason S. Ku, Jayson Lynch

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

2017

Folded Structures Satisfying Multiple Conditions.

Erik D. Demaine, Jason S. Ku

J. Inf. Process., 2017

Simple Folding is Really Hard.

Hugo A. Akitaya, Erik D. Demaine, Jason S. Ku

J. Inf. Process., 2017

Computing 3SAT on a Fold-and-Cut Machine.

Byoungkwon An, Erik D. Demaine, Martin L. Demaine, Jason S. Ku

Proceedings of the 29th Canadian Conference on Computational Geometry, 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

Folding Flat Crease Patterns with Thick Materials.

Jason S. Ku, Erik D. Demaine

CoRR, 2016

2015

Box Pleating is Hard.

Hugo Alves 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

Landmark mapping from unbiased observations.

Jason S. Ku, Stephen Ho, Sanjay E. Sarma

Proceedings of the IEEE First International Smart Cities Conference, 2015

2014

Filling a Hole in a Crease Pattern: Isometric Mapping from Prescribed Boundary Folding.

Erik D. Demaine, Jason S. Ku

CoRR, 2014