Single-Vertex Origami and Spherical Expansive Motions
@inproceedings{Streinu2004SingleVertexOA, title={Single-Vertex Origami and Spherical Expansive Motions}, author={I. Streinu and W. Whiteley}, booktitle={JCDCG}, year={2004} }
We prove that all single-vertex origami shapes are reachable from the open flat state via simple, non-crossing motions. We also consider conical paper, where the total sum of the cone angles centered at the origami vertex is not 2π. For an angle sum less than 2π, the configuration space of origami shapes compatible with the given metric has two components, and within each component, a shape can always be reconfigured via simple (non-crossing) motions. Such a reconfiguration may not always be… CONTINUE READING
48 Citations
Flattening single-vertex origami: the non-expansive case
- Mathematics, Computer Science
- SCG '09
- 2009
- 3
- PDF
Flattening single-vertex origami: The non-expansive case
- Mathematics, Computer Science
- Comput. Geom.
- 2010
- 4
On rigid origami I: piecewise-planar paper with straight-line creases
- Mathematics, Computer Science
- Proceedings of the Royal Society A
- 2019
- 6
- Highly Influenced
- PDF
Modelling rigid origami with quaternions and dual quaternions
- Mathematics
- Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
- 2010
- 88
- PDF
A Generalized Carpenter's Rule Theorem for Self-Touching Linkages
- Mathematics, Computer Science
- ArXiv
- 2009
- 11
- PDF
References
SHOWING 1-10 OF 23 REFERENCES
Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami
- Mathematics, Computer Science
- SCG '99
- 1999
- 99
- PDF
A combinatorial approach to planar non-colliding robot arm motion planning
- Mathematics, Computer Science
- Proceedings 41st Annual Symposium on Foundations of Computer Science
- 2000
- 175
- PDF
Straightening polygonal arcs and convexifying polygonal cycles
- Mathematics, Computer Science
- Proceedings 41st Annual Symposium on Foundations of Computer Science
- 2000
- 172
- PDF
Locked and Unlocked Polygonal Chains in Three Dimensions
- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2001
- 40
- PDF