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.
|出版ステータス||Published - 2017|
|イベント||29th Canadian Conference on Computational Geometry, CCCG 2017 - Ottawa, Canada|
継続期間: 2017 7 26 → 2017 7 28
|Conference||29th Canadian Conference on Computational Geometry, CCCG 2017|
|Period||17/7/26 → 17/7/28|
ASJC Scopus subject areas