13 citations · 18 across the 6 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2019
Infinite All-Layers Simple Foldability
Hugo A. Akitaya, Cordelia Avery, Joseph Bergeron +3
We study the problem of deciding whether a crease pattern can be folded by simple folds (folding along one line at a time) under the infinite all-layers model introduced by [Akitay…
cs.CG2018
Path Puzzles: Discrete Tomography with a Path Constraint is Hard
Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine +3
We prove that path puzzles with complete row and column information--or equivalently, 2D orthogonal discrete tomography with Hamiltonicity constraint--are strongly NP-complete, ASP…