Folding Polyominoes into (Poly) Cubes
© 2015 Queen's University Ontario Canada. All rights reserved. We study the problem of folding a given polyomino S into a polycube C under different folding models, allowing faces of C to be covered multiple times. First, we define a variety of folding models according to whether the folds (a)...
| Main Authors: | , , , , , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2021
|
| Online Access: | https://hdl.handle.net/1721.1/137770 |
| _version_ | 1826216484029857792 |
|---|---|
| author | Aichholzer, Oswin Biro, Michael Demaine, Erik D. Demaine, Martin L. Eppstein, David Fekete, Sándor P. Hesterberg, Adam Kostitsyna, Irina Schmidt, Christiane |
| author2 | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
| author_facet | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Aichholzer, Oswin Biro, Michael Demaine, Erik D. Demaine, Martin L. Eppstein, David Fekete, Sándor P. Hesterberg, Adam Kostitsyna, Irina Schmidt, Christiane |
| author_sort | Aichholzer, Oswin |
| collection | MIT |
| description | © 2015 Queen's University Ontario Canada. All rights reserved. We study the problem of folding a given polyomino S into a polycube C under different folding models, allowing faces of C to be covered multiple times. First, we define a variety of folding models according to whether the folds (a) must be along grid lines ofPor can divide squares in half(diagonally and/or orthogonally), (b) must be mountain or can be both mountain and valley, (c) can remain flat (forming an angle of 180◦), and (d) must lie on just the polycube surface or can have interior faces as well. Second, we give all the inclusion relations among all models that fold on the grid lines of P. Third, we characterize all polyominoes that can fold into a unit cube, in some models. Fourth, we give a linear-time dynamic programming algorithm to fold a tree-shaped polyomino into a constant-size polycube, in some models. Finally, we consider the triangular version of the problem,characterizing which polyiamonds fold into a regular tetrahedron. |
| first_indexed | 2024-09-23T16:48:08Z |
| format | Article |
| id | mit-1721.1/137770 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T16:48:08Z |
| publishDate | 2021 |
| record_format | dspace |
| spelling | mit-1721.1/1377702022-09-29T21:35:57Z Folding Polyominoes into (Poly) Cubes Aichholzer, Oswin Biro, Michael Demaine, Erik D. Demaine, Martin L. Eppstein, David Fekete, Sándor P. Hesterberg, Adam Kostitsyna, Irina Schmidt, Christiane Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology. Department of Mathematics © 2015 Queen's University Ontario Canada. All rights reserved. We study the problem of folding a given polyomino S into a polycube C under different folding models, allowing faces of C to be covered multiple times. First, we define a variety of folding models according to whether the folds (a) must be along grid lines ofPor can divide squares in half(diagonally and/or orthogonally), (b) must be mountain or can be both mountain and valley, (c) can remain flat (forming an angle of 180◦), and (d) must lie on just the polycube surface or can have interior faces as well. Second, we give all the inclusion relations among all models that fold on the grid lines of P. Third, we characterize all polyominoes that can fold into a unit cube, in some models. Fourth, we give a linear-time dynamic programming algorithm to fold a tree-shaped polyomino into a constant-size polycube, in some models. Finally, we consider the triangular version of the problem,characterizing which polyiamonds fold into a regular tetrahedron. 2021-11-08T18:44:28Z 2021-11-08T18:44:28Z 2015 2019-06-18T12:21:52Z Article http://purl.org/eprint/type/ConferencePaper https://hdl.handle.net/1721.1/137770 Aichholzer, Oswin, Biro, Michael, Demaine, Erik D., Demaine, Martin L., Eppstein, David et al. 2018. "Folding Polyominoes into (Poly) Cubes." en http://research.cs.queensu.ca/cccg2015/ Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf arXiv |
| spellingShingle | Aichholzer, Oswin Biro, Michael Demaine, Erik D. Demaine, Martin L. Eppstein, David Fekete, Sándor P. Hesterberg, Adam Kostitsyna, Irina Schmidt, Christiane Folding Polyominoes into (Poly) Cubes |
| title | Folding Polyominoes into (Poly) Cubes |
| title_full | Folding Polyominoes into (Poly) Cubes |
| title_fullStr | Folding Polyominoes into (Poly) Cubes |
| title_full_unstemmed | Folding Polyominoes into (Poly) Cubes |
| title_short | Folding Polyominoes into (Poly) Cubes |
| title_sort | folding polyominoes into poly cubes |
| url | https://hdl.handle.net/1721.1/137770 |
| work_keys_str_mv | AT aichholzeroswin foldingpolyominoesintopolycubes AT biromichael foldingpolyominoesintopolycubes AT demaineerikd foldingpolyominoesintopolycubes AT demainemartinl foldingpolyominoesintopolycubes AT eppsteindavid foldingpolyominoesintopolycubes AT feketesandorp foldingpolyominoesintopolycubes AT hesterbergadam foldingpolyominoesintopolycubes AT kostitsynairina foldingpolyominoesintopolycubes AT schmidtchristiane foldingpolyominoesintopolycubes |