2020/01/01 by Jin Akiyama, Kiyoko Matsunaga · 1 citation
Computer Science · Engineering · Mathematics · #Computational Geometry and Mesh Generation #Advanced Materials and Mechanics #Mathematics and Applications #Tile #Rectangle #Folding (DSP implementation) #Computer science #Algorithm #Combinatorics #Fold (higher-order function) #Mathematics #Geometry #Programming language #Structural engineering
paper · pdf · doi:10.2197/ipsjjip.28.750
openalex publication_date 2020/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/26
Every net of an isotetrahedron (I) or a rectangle dihedron (RD) is a Conway tile. Reversely, it is shown by using Alexandrov's theorem that every Conway tile can be folded into either I or RD. However, it was not known how to fold a given Conway tile into I or RD. The purpose of this paper is to give an algorithm for folding a Conway tile into I or RD. Moreover, for a given Conway tile we present a method to identify the exact shape of I or RD into which it can be folded.