The following pages link to When can you fold a map? (Q1883580):
Displaying 15 items.
- Algorithmic folding complexity (Q659709) (← links)
- Lipschitz-continuous local isometric immersions: rigid maps and origami (Q935286) (← links)
- Bumpy pyramid folding (Q1615921) (← links)
- Recognizing weakly simple polygons (Q1688854) (← links)
- Infinite all-layers simple foldability (Q2308494) (← links)
- When can a net fold to a polyhedron? (Q2486084) (← links)
- Folding a paper strip to minimize thickness (Q2634713) (← links)
- Box Pleating is Hard (Q2958099) (← links)
- Upward Partitioned Book Embeddings (Q4625113) (← links)
- Radial Level Planarity with Fixed Embedding (Q4994349) (← links)
- Origami and Fractal Solutions of Differential Systems (Q5049287) (← links)
- CATEGORY OF STRIP FOLDING IN TERMS OF A BOOLEAN MATRIX REPRESENTATION (Q5055006) (← links)
- Rigid foldability is NP-hard (Q5120145) (← links)
- SIMILARITY STRUCTURE ON 2-DIMENSIONAL TORUS AND FLAT ORIGAMI (Q5215094) (← links)
- Heyting algebra in flat origami (Q6634334) (← links)