Snipperclips: Cutting tools into desired polygons using themselves
Name
2105.08305.pdf
Description
Accepted version
Size
1.28 MB
Format
Adobe PDF
Checksum (MD5)
366a9d03896340f1a314c6ace5f0c39c
Author(s)
Abel, Zachary
Akitaya, Hugo
Chiu, Man-Kwun
Demaine, Erik D
Demaine, Martin L
Hesterberg, Adam
Korman, Matias
Lynch, Jayson
van Renssen, André
Roeloffzen, Marcel
Date Issued
2021
Journal
Computational Geometry: Theory and Applications
Publisher
Elsevier BV
Citation
Abel, Zachary, Akitaya, Hugo, Chiu, Man-Kwun, Demaine, Erik D, Demaine, Martin L et al. 2021. "Snipperclips: Cutting tools into desired polygons using themselves." Computational Geometry: Theory and Applications, 98.
Version
Author's final manuscript
Abstract
Compilation copyright © 2017 Michiel Smid Copyright of individual papers retained by authors.All right reserved. We study Snipperclips, a computer puzzle game whose objective is to create a target shape with two tools. The tools start as constant-complexity shapes, and each tool can snip (i.e., subtract its current shape from) the other tool. We study the computational problem of, given a target shape represented by a polygonal domain of n vertices, is it possible to create it as one of the tools' shape via a sequence of snip operations? If so, how many snip operations are required? We show that a polynomial number of snips suffice for two different variants of the problem.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/J.COMGEO.2021.101784
