{"title":"将多胺折叠成八面体","authors":"Eva Stehr, Linda Kleist","doi":"10.1016/j.comgeo.2022.101917","DOIUrl":null,"url":null,"abstract":"<div><p><span>We study polyiamonds (polygons arising from the triangular grid) that fold into the smallest yet unstudied platonic solid – the </span>octahedron<span>. We show a number of results. Firstly, we characterize foldable polyiamonds containing a hole of positive area, namely each but one polyiamond is foldable. Secondly, we show that a convex polyiamond folds into the octahedron if and only if it contains one of five polyiamonds. We thirdly present a sharp size bound: While there exist unfoldable polyiamonds of size 14, every polyiamond of size at least 15 folds into the octahedron. This clearly implies that one can test in polynomial time whether a given polyiamond folds into the octahedron. Lastly, we show that for any assignment of positive integers to the faces, there exists a polyiamond that folds into the octahedron such that the number of triangles covering a face is equal to the assigned number.</span></p></div>","PeriodicalId":51001,"journal":{"name":"Computational Geometry-Theory and Applications","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Folding polyiamonds into octahedra\",\"authors\":\"Eva Stehr, Linda Kleist\",\"doi\":\"10.1016/j.comgeo.2022.101917\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span>We study polyiamonds (polygons arising from the triangular grid) that fold into the smallest yet unstudied platonic solid – the </span>octahedron<span>. We show a number of results. Firstly, we characterize foldable polyiamonds containing a hole of positive area, namely each but one polyiamond is foldable. Secondly, we show that a convex polyiamond folds into the octahedron if and only if it contains one of five polyiamonds. We thirdly present a sharp size bound: While there exist unfoldable polyiamonds of size 14, every polyiamond of size at least 15 folds into the octahedron. This clearly implies that one can test in polynomial time whether a given polyiamond folds into the octahedron. Lastly, we show that for any assignment of positive integers to the faces, there exists a polyiamond that folds into the octahedron such that the number of triangles covering a face is equal to the assigned number.</span></p></div>\",\"PeriodicalId\":51001,\"journal\":{\"name\":\"Computational Geometry-Theory and Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Geometry-Theory and Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0925772122000608\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Geometry-Theory and Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925772122000608","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
We study polyiamonds (polygons arising from the triangular grid) that fold into the smallest yet unstudied platonic solid – the octahedron. We show a number of results. Firstly, we characterize foldable polyiamonds containing a hole of positive area, namely each but one polyiamond is foldable. Secondly, we show that a convex polyiamond folds into the octahedron if and only if it contains one of five polyiamonds. We thirdly present a sharp size bound: While there exist unfoldable polyiamonds of size 14, every polyiamond of size at least 15 folds into the octahedron. This clearly implies that one can test in polynomial time whether a given polyiamond folds into the octahedron. Lastly, we show that for any assignment of positive integers to the faces, there exists a polyiamond that folds into the octahedron such that the number of triangles covering a face is equal to the assigned number.
期刊介绍:
Computational Geometry is a forum for research in theoretical and applied aspects of computational geometry. The journal publishes fundamental research in all areas of the subject, as well as disseminating information on the applications, techniques, and use of computational geometry. Computational Geometry publishes articles on the design and analysis of geometric algorithms. All aspects of computational geometry are covered, including the numerical, graph theoretical and combinatorial aspects. Also welcomed are computational geometry solutions to fundamental problems arising in computer graphics, pattern recognition, robotics, image processing, CAD-CAM, VLSI design and geographical information systems.
Computational Geometry features a special section containing open problems and concise reports on implementations of computational geometry tools.