Journal article · 2016 · Open access
Rigid origami vertices: conditions and forcing sets
Journal of computational geometry, 7(1) · Published 26 April 2016 · DOI 10.20382/jocg.v7i1a9
In brief
“Rigid origami vertices: conditions and forcing sets” is a 2016 journal article by Zachary Abel and 7 co-authors, published in Journal of computational geometry. OpenAlex counts 73 citations as of 22 November 2026. It is open access under a CC BY licence: the full text is free to read at Journal of computational geometry.
- Citations
- 73
- Most cited in
- 2018 (13)
- Field-weighted impact
- 12.76
- References
- 16
- Authors
- 8
Abstract
We develop an intrinsic necessary and sufficient condition for single-vertex origami crease patterns to be able to fold rigidly. We classify such patterns in the case where the creases are pre-assigned to be mountains and valleys as well as in the unassigned case. We also illustrate the utility of this result by applying it to the new concept of minimal forcing sets for rigid origami models, which are the smallest collection of creases that, when folded, will force all the other creases to fold in a prescribed way.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Abel, Z., Cantarella, J. H., Demaine, E. D., Eppstein, D., Hull, T. C., Ku, J. S., Lang, R. J., & Tachi, T. (2016). Rigid origami vertices: conditions and forcing sets. Journal of computational geometry, 7(1). https://doi.org/10.20382/jocg.v7i1a9
MLA 9
Abel, Zachary, et al. “Rigid origami vertices: conditions and forcing sets.” Journal of computational geometry, vol. 7, no. 1, 2016. https://doi.org/10.20382/jocg.v7i1a9.
Chicago
Abel, Zachary, Jason H. Cantarella, Erik D. Demaine, David Eppstein, Thomas C. Hull, Jason S. Ku, Robert J. Lang, and Tomohiro Tachi. 2016. “Rigid origami vertices: conditions and forcing sets.” Journal of computational geometry 7 (1). https://doi.org/10.20382/jocg.v7i1a9.
Harvard
Abel, Z. et al. (2016) ‘Rigid origami vertices: conditions and forcing sets’, Journal of computational geometry, 7(1). doi:10.20382/jocg.v7i1a9.
IEEE
Z. Abel et al., “Rigid origami vertices: conditions and forcing sets,” Journal of computational geometry, vol. 7, no. 1, 2016, doi: 10.20382/jocg.v7i1a9.
BibTeX
@article{abel2016rigid,
title = {{Rigid origami vertices: conditions and forcing sets}},
author = {Abel, Zachary and Cantarella, Jason H. and Demaine, Erik D. and Eppstein, David and Hull, Thomas C. and Ku, Jason S. and Lang, Robert J. and Tachi, Tomohiro},
journal = {Journal of computational geometry},
year = {2016},
volume = {7},
number = {1},
doi = {10.20382/jocg.v7i1a9},
url = {https://doi.org/10.20382/jocg.v7i1a9}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 9 | |
| 2018 | 13 | |
| 2019 | 12 | |
| 2020 | 7 | |
| 2021 | 4 | |
| 2022 | 6 | |
| 2023 | 3 | |
| 2024 | 6 | |
| 2025 | 4 | |
| 2026 | 2 |
Its field-weighted citation impact is 12.76: it has been cited 12.76 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
- rigid origami
- crease patterns
- necessary and sufficient conditions
- origami models
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Abel, Z., Cantarella, J. H., Demaine, E. D., Eppstein, D., Hull, T. C., Ku, J. S., Lang, R. J., & Tachi, T. (2016). Rigid origami vertices: conditions and forcing sets. Journal of computational geometry, 7(1). https://doi.org/10.20382/jocg.v7i1a9
How many times has this paper been cited?
73 times, according to OpenAlex on 22 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Journal of computational geometry: sign in and open the full text from this page.
Who wrote this paper?
Zachary Abel, Jason H. Cantarella, Erik D. Demaine, David Eppstein, Thomas C. Hull, Jason S. Ku, Robert J. Lang, Tomohiro Tachi.
What is the DOI of this paper?
10.20382/jocg.v7i1a9, permanently at https://doi.org/10.20382/jocg.v7i1a9. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 22 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.