Origami Crease Pattern Design Proved NP-Hard
Folding a square sheet of paper into an arbitrary 3D shape is proved to be NP-hard problem. It is proved by transforming the problem into circle packing problem[1].
[1] arxiv.org/abs/1008.1224: Circle Packing for Origami Design Is Hard
...