Show simple item record

dc.contributor.authorKita, Naokien_US
dc.contributor.editorChaine, Raphaëlleen_US
dc.contributor.editorDeng, Zhigangen_US
dc.contributor.editorKim, Min H.en_US
dc.date.accessioned2023-10-09T07:36:44Z
dc.date.available2023-10-09T07:36:44Z
dc.date.issued2023
dc.identifier.issn1467-8659
dc.identifier.urihttps://doi.org/10.1111/cgf.14968
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf14968
dc.description.abstractDissection 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.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectCCS Concepts: Computing methodologies -> Computer graphics; Mathematics of computing -> Combinatorial optimization
dc.subjectComputing methodologies
dc.subjectComputer graphics
dc.subjectMathematics of computing
dc.subjectCombinatorial optimization
dc.titleDissection Puzzles Composed of Multicolor Polyominoesen_US
dc.description.seriesinformationComputer Graphics Forum
dc.description.sectionheadersImages, Vectorization, and Layouts
dc.description.volume42
dc.description.number7
dc.identifier.doi10.1111/cgf.14968
dc.identifier.pages9 pages


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

  • 42-Issue 7
    Pacific Graphics 2023 - Symposium Proceedings

Show simple item record