刚性折纸顶点:条件和强制集

Q4 Mathematics

International Journal of Computational Geometry & Applications Pub Date : 2015-07-06 DOI:10.20382/jocg.v7i1a9

Zachary Abel, Jason H. Cantarella, E. Demaine, D. Eppstein, Thomas C. Hull, Jason S. Ku, R. Lang, Tomohiro Tachi

{"title":"刚性折纸顶点:条件和强制集","authors":"Zachary Abel, Jason H. Cantarella, E. Demaine, D. Eppstein, Thomas C. Hull, Jason S. Ku, R. Lang, Tomohiro Tachi","doi":"10.20382/jocg.v7i1a9","DOIUrl":null,"url":null,"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.","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":"56 1","pages":"171-184"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"53","resultStr":"{\"title\":\"Rigid origami vertices: conditions and forcing sets\",\"authors\":\"Zachary Abel, Jason H. Cantarella, E. Demaine, D. Eppstein, Thomas C. Hull, Jason S. Ku, R. Lang, Tomohiro Tachi\",\"doi\":\"10.20382/jocg.v7i1a9\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":54969,\"journal\":{\"name\":\"International Journal of Computational Geometry & Applications\",\"volume\":\"56 1\",\"pages\":\"171-184\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"53\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computational Geometry & Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.20382/jocg.v7i1a9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computational Geometry & Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20382/jocg.v7i1a9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 53

摘要

给出了单顶点折纸折痕图能够刚性折叠的内在充要条件。我们在折痕被预先分配为山折和谷折的情况下以及在未分配的情况下对这种模式进行分类。我们还通过将其应用于刚性折纸模型的最小强制集的新概念来说明该结果的实用性，刚性折纸模型是最小的折痕集合，当折叠时，将迫使所有其他折痕以规定的方式折叠。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Rigid origami vertices: conditions and forcing sets

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Journal of Computational Geometry & Applications 数学-计算机：理论方法

CiteScore

0.80

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The International Journal of Computational Geometry & Applications (IJCGA) is a quarterly journal devoted to the field of computational geometry within the framework of design and analysis of algorithms. Emphasis is placed on the computational aspects of geometric problems that arise in various fields of science and engineering including computer-aided geometry design (CAGD), computer graphics, constructive solid geometry (CSG), operations research, pattern recognition, robotics, solid modelling, VLSI routing/layout, and others. Research contributions ranging from theoretical results in algorithm design — sequential or parallel, probabilistic or randomized algorithms — to applications in the above-mentioned areas are welcome. Research findings or experiences in the implementations of geometric algorithms, such as numerical stability, and papers with a geometric flavour related to algorithms or the application areas of computational geometry are also welcome.