Abstract
Any net of an isotetrahedron I (a tetrahedron with all congruent four faces) and a rectangle dihedra RD satisfies the Conway criterion. Does the converse proposition hold? If so, are there practical algorithms for it? The difficult part of the proof of it comes down to the following problem [5], [6]: Find the practical algorithm for folding a parallelogramic strip into I or RD. The process of how to cover a thin rectangular board by a long tape without making gaps or overlaps has been known as a folklore among natives in various places globally [1]. By generalizing the known folklore foldings, this paper gives the practical algorithms to obtain all isotetrahedra and rectangle dihedra into which a strip can be folded. As a result of it, it is also proved that there is no other way to fold a given strip into rectangle dihedra other than the known two types of folklore foldings.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
