Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Randomized algorithms
A computational algorithm for origami design
Proceedings of the twelfth annual symposium on Computational geometry
The complexity of flat origami
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Faster deterministic sorting and priority queues in linear space
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami
Computational Geometry: Theory and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An algorithmic study of manufacturing paperclips and other folded structures
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Optimal suffix tree construction with large alphabets
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
When can a net fold to a polyhedron?
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
When can a net fold to a polyhedron?
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Algorithmic Folding Complexity
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Kaboozle is NP-complete, even in a strip
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Complexity of the stamp folding problem
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Survey on model-based manipulation planning of deformable objects
Robotics and Computer-Integrated Manufacturing
Making polygons by simple folds and one straight cut
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Hi-index | 0.00 |
We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a fiat folding by a sequence of simple folds? There are several models of simple folds; the simplest one-layer simple fold rotates a portion of paper about a crease in the paper by ±180°. We first consider the analogous questions in one dimension lower--bending a segment into a flat object--which lead to interesting problems on strings. We develop efficient algorithms for the recognition of simply foldable 1D crease patterns, and reconstruction of a sequence of simple folds. Indeed, we prove that a 1D crease pattern is flat-foldable by any means precisely if it is by a sequence of one-layer simple folds. Next we explore simple foldability in two dimensions, and find a surprising contrast: "map" folding and variants are polynomial, but slight generalizations are NP-complete. Specifically, we develop a linear-time algorithm for deciding foldability of an orthogonal crease pattern on a rectangular piece of paper, and prove that it is (weakly) NP-complete to decide foldability of (1) an orthogonal crease pattern on a orthogonal piece of paper, (2) a crease pattern of axis-parallel and diagonal (45-degree) creases on a square piece of paper, and (3) crease patterns without a mountain/valley assignment.