Snipperclips: Cutting Tools into Desired Polygons using Themselves

Erik D. Demaine, Matias Korman, André Van Renssen, Marcel Roeloffzen

Research output: Contribution to conferencePaper

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 show that a polynomial number of snips suffice for two different variants of the problem.

Original languageEnglish
Pages56-61
Number of pages6
Publication statusPublished - 2017 Jan 1
Event29th Canadian Conference on Computational Geometry, CCCG 2017 - Ottawa, Canada
Duration: 2017 Jul 262017 Jul 28

Conference

Conference29th Canadian Conference on Computational Geometry, CCCG 2017
CountryCanada
CityOttawa
Period17/7/2617/7/28

ASJC Scopus subject areas

  • Computational Mathematics
  • Geometry and Topology

Fingerprint Dive into the research topics of 'Snipperclips: Cutting Tools into Desired Polygons using Themselves'. Together they form a unique fingerprint.

  • Cite this

    Demaine, E. D., Korman, M., Van Renssen, A., & Roeloffzen, M. (2017). Snipperclips: Cutting Tools into Desired Polygons using Themselves. 56-61. Paper presented at 29th Canadian Conference on Computational Geometry, CCCG 2017, Ottawa, Canada.