Dissection Puzzles Composed of Multicolor Polyominoes
| dc.contributor.author | Kita, Naoki | en_US |
| dc.contributor.editor | Chaine, Raphaëlle | en_US |
| dc.contributor.editor | Deng, Zhigang | en_US |
| dc.contributor.editor | Kim, Min H. | en_US |
| dc.date.accessioned | 2023-10-09T07:36:44Z | |
| dc.date.available | 2023-10-09T07:36:44Z | |
| dc.date.issued | 2023 | |
| dc.description.abstract | Dissection puzzles leverage geometric dissections, wherein a set of puzzle pieces can be reassembled in various configurations to yield unique geometric figures. Mathematically, a dissection between two 2D polygons can always be established. Consequently, researchers and puzzle enthusiasts strive to design unique dissection puzzles using the fewest pieces feasible. In this study, we introduce novel dissection puzzles crafted with multi-colored polyominoes. Diverging from the traditional aim of establishing geometric dissection between two 2D polygons with the minimal piece count, we seek to identify a common pool of polyomino pieces with colored faces that can be configured into multiple distinct shapes and appearances. Moreover, we offer a method to identify an optimized sequence for rearranging pieces from one form to another, thus minimizing the total relocation distance. This approach can guide users in puzzle assembly and lessen their physical exertion when manually reconfiguring pieces. It could potentially also decrease power consumption when pieces are reorganized using robotic assistance. We showcase the efficacy of our proposed approach through a wide range of shapes and appearances. | en_US |
| dc.description.number | 7 | |
| dc.description.sectionheaders | Images, Vectorization, and Layouts | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 42 | |
| dc.identifier.doi | 10.1111/cgf.14968 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 9 pages | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.14968 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf14968 | |
| dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.subject | CCS Concepts: Computing methodologies -> Computer graphics; Mathematics of computing -> Combinatorial optimization | |
| dc.subject | Computing methodologies | |
| dc.subject | Computer graphics | |
| dc.subject | Mathematics of computing | |
| dc.subject | Combinatorial optimization | |
| dc.title | Dissection Puzzles Composed of Multicolor Polyominoes | en_US |