Folding Polyominoes into (Poly)Cubes

Oswin Aichholzer, Michael Biro, Erik Demaine, Martin Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt

Publikation: Beitrag in einer FachzeitschriftArtikelForschungBegutachtung

Abstract

We study the problem of folding a given polyomino $P$ into a polycube~$Q$, allowing faces of $Q$ to be covered multiple times. First, we define a variety of folding models according to whether the folds (a)~must be along grid lines of $P$ or 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)~whether the folding must lie on just the polycube surface or can have interior faces as well. Second, we give all 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.
Originalspracheenglisch
Seiten (von - bis)197-226
Seitenumfang30
FachzeitschriftInternational Journal of Computational Geometry and Applications
Jahrgang28
Ausgabenummer3
DOIs
PublikationsstatusVeröffentlicht - 2018

Schlagwörter

  • Computational Geometry

Fields of Expertise

  • Information, Communication & Computing

Dies zitieren

Aichholzer, O., Biro, M., Demaine, E., Demaine, M., Eppstein, D., Fekete, S. P., ... Schmidt, C. (2018). Folding Polyominoes into (Poly)Cubes. International Journal of Computational Geometry and Applications, 28(3), 197-226. https://doi.org/10.1142/S0218195918500048

Folding Polyominoes into (Poly)Cubes. / Aichholzer, Oswin; Biro, Michael; Demaine, Erik; Demaine, Martin; Eppstein, David; Fekete, Sándor P.; Hesterberg, Adam; Kostitsyna, Irina; Schmidt, Christiane.

in: International Journal of Computational Geometry and Applications, Jahrgang 28, Nr. 3, 2018, S. 197-226.

Publikation: Beitrag in einer FachzeitschriftArtikelForschungBegutachtung

Aichholzer, O, Biro, M, Demaine, E, Demaine, M, Eppstein, D, Fekete, SP, Hesterberg, A, Kostitsyna, I & Schmidt, C 2018, 'Folding Polyominoes into (Poly)Cubes' International Journal of Computational Geometry and Applications, Jg. 28, Nr. 3, S. 197-226. https://doi.org/10.1142/S0218195918500048
Aichholzer, Oswin ; Biro, Michael ; Demaine, Erik ; Demaine, Martin ; Eppstein, David ; Fekete, Sándor P. ; Hesterberg, Adam ; Kostitsyna, Irina ; Schmidt, Christiane. / Folding Polyominoes into (Poly)Cubes. in: International Journal of Computational Geometry and Applications. 2018 ; Jahrgang 28, Nr. 3. S. 197-226.
@article{88cf0ec4dc6545ed8c1df26a998ec746,
title = "Folding Polyominoes into (Poly)Cubes",
abstract = "We study the problem of folding a given polyomino $P$ into a polycube~$Q$, allowing faces of $Q$ to be covered multiple times. First, we define a variety of folding models according to whether the folds (a)~must be along grid lines of $P$ or 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)~whether the folding must lie on just the polycube surface or can have interior faces as well. Second, we give all 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.",
keywords = "Computational Geometry",
author = "Oswin Aichholzer and Michael Biro and Erik Demaine and Martin Demaine and David Eppstein and Fekete, {S{\'a}ndor P.} and Adam Hesterberg and Irina Kostitsyna and Christiane Schmidt",
year = "2018",
doi = "10.1142/S0218195918500048",
language = "English",
volume = "28",
pages = "197--226",
journal = "International Journal of Computational Geometry and Applications",
issn = "0218-1959",
publisher = "World Scientific Publishing Co Pte Ltd",
number = "3",

}

TY - JOUR

T1 - Folding Polyominoes into (Poly)Cubes

AU - Aichholzer, Oswin

AU - Biro, Michael

AU - Demaine, Erik

AU - Demaine, Martin

AU - Eppstein, David

AU - Fekete, Sándor P.

AU - Hesterberg, Adam

AU - Kostitsyna, Irina

AU - Schmidt, Christiane

PY - 2018

Y1 - 2018

N2 - We study the problem of folding a given polyomino $P$ into a polycube~$Q$, allowing faces of $Q$ to be covered multiple times. First, we define a variety of folding models according to whether the folds (a)~must be along grid lines of $P$ or 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)~whether the folding must lie on just the polycube surface or can have interior faces as well. Second, we give all 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.

AB - We study the problem of folding a given polyomino $P$ into a polycube~$Q$, allowing faces of $Q$ to be covered multiple times. First, we define a variety of folding models according to whether the folds (a)~must be along grid lines of $P$ or 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)~whether the folding must lie on just the polycube surface or can have interior faces as well. Second, we give all 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.

KW - Computational Geometry

U2 - 10.1142/S0218195918500048

DO - 10.1142/S0218195918500048

M3 - Article

VL - 28

SP - 197

EP - 226

JO - International Journal of Computational Geometry and Applications

JF - International Journal of Computational Geometry and Applications

SN - 0218-1959

IS - 3

ER -