Name
Abstract | ||
|---|---|---|
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 consider several variants of the problem (such as allowing the tools to be disconnected and/or using an undo operation) and bound the number of operations needed for each of the variants. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.comgeo.2021.101784 | Computational Geometry |
Keywords | DocType | Volume |
Puzzle game,Cutting tool,Shape matching | Journal | 98 |
ISSN | Citations | PageRank |
0925-7721 | 0 | 0.34 |
References | Authors | |
0 | 10 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zachary Abel | 1 | 0 | 0.34 |
| Hugo Akitaya | 2 | 0 | 0.34 |
| Man-Kwun Chiu | 3 | 0 | 0.34 |
| Erik D. Demaine | 4 | 4624 | 388.59 |
| Martin L. Demaine | 5 | 592 | 84.37 |
| Adam Hesterberg | 6 | 4 | 7.07 |
| Matias Korman | 7 | 0 | 1.35 |
| Jayson Lynch | 8 | 0 | 2.70 |
| André van Renssen | 9 | 3 | 4.74 |
| Marcel Roeloffzen | 10 | 18 | 5.55 |