DocumentCode
2185140
Title
Knot Fold of Regular Polygons: Computer-Assisted Construction and Verification
Author
Ida, Tetsuo ; Ghourabi, Fadoua ; Takahashi, Koichi
Author_Institution
Dept. of Comput. Sci., Univ. of Tsukuba, Tsukuba, Japan
fYear
2013
fDate
23-26 Sept. 2013
Firstpage
12
Lastpage
19
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.
Keywords
computational complexity; computational geometry; algebraic methods; computational origami; computer-assisted regular polygon construction; computer-assisted verification; knot paper fold; rectangular origami; regular pentagon; Earth Observing System; Educational institutions; Electronic mail; Face; Informatics; Joining processes; Shape; Gröebner bases; computational origami; knot fold;
fLanguage
English
Publisher
ieee
Conference_Titel
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2013 15th International Symposium on
Conference_Location
Timisoara
Print_ISBN
978-1-4799-3035-7
Type
conf
DOI
10.1109/SYNASC.2013.9
Filename
6821125
Link To Document