Knot Fold of Regular Polygons: Computer-Assisted Construction and Verification

T. Ida, Fadoua Ghourabi, Kazuko Takahashi
{"title":"Knot Fold of Regular Polygons: Computer-Assisted Construction and Verification","authors":"T. Ida, Fadoua Ghourabi, Kazuko Takahashi","doi":"10.1109/SYNASC.2013.9","DOIUrl":null,"url":null,"abstract":"We present computer-assisted construction of regular polygons by knot paper fold. The construction is completed with an automated proof based on algebraic methods. Given a rectangular origami or a finite tape, both of an adequate length, we can construct the simplest knot by making three folds. The shape of the knot is made to be a regular pentagon if we fasten the tape tightly without destroying the tape. We performed the analysis of the knot fold further formally towards the computer assisted construction and verification. Our study yielded more rigor and in-depth results about the subject.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2013.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

We present computer-assisted construction of regular polygons by knot paper fold. The construction is completed with an automated proof based on algebraic methods. Given a rectangular origami or a finite tape, both of an adequate length, we can construct the simplest knot by making three folds. The shape of the knot is made to be a regular pentagon if we fasten the tape tightly without destroying the tape. We performed the analysis of the knot fold further formally towards the computer assisted construction and verification. Our study yielded more rigor and in-depth results about the subject.
正多边形的结褶:计算机辅助构造与验证
提出了用计算机辅助构造正多边形的打结折纸方法。通过基于代数方法的自动证明完成了构造。给定一个矩形折纸或一个有限的胶带,两者都有足够的长度,我们可以通过三次折叠来构造最简单的结。如果我们把带子系紧而不破坏带子,结的形状就会变成正五边形。在计算机辅助构造和验证的基础上,进一步正式进行了结褶分析。我们的研究在这个问题上得出了更加严谨和深入的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信