Snipperclips: Cutting tools into desired polygons using themselves

Snipperclips: Cutting tools into desired polygons using themselves

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., subt...

Full description

Bibliographic Details
Main Authors:	Abel, Zachary (Author), Akitaya, Hugo (Author), Chiu, Man-Kwun (Author), Demaine, Erik D (Author), Demaine, Martin L (Author), Hesterberg, Adam (Author), Korman, Matias (Author), Lynch, Jayson (Author), van Renssen, André (Author), Roeloffzen, Marcel (Author)
Format:	Article
Language:	English
Published:	Elsevier BV, 2022-07-22T14:46:35Z.
Subjects:	Article
Online Access:	Get fulltext

Similar Items

Circumscribing Polygons and Polygonizations for Disjoint Line Segments
by: Akitaya, Hugo A., et al.
Published: (2022)

Making polygons by simple folds and one straight cut
by: Demaine, Erik D., et al.
Published: (2012)

Pachinko
by: Akitaya, Hugo A., et al.
Published: (2020)

Any Monotone Function Is Realized by Interlocked Polygons
by: Erik D. Demaine, et al.
Published: (2012-03-01)

Any Monotone Function Is Realized by Interlocked Polygons
by: Demaine, Erik D., et al.
Published: (2014)

Any Monotone Boolean Function Can Be Realized by Interlocked Polygons
by: Demaine, Erik D., et al.
Published: (2011)

Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces
by: Korman, Matias, et al.
Published: (2017)

Tetris is NP-hard even with O (1) Rows or Columns
by: Asif, Sualeh, et al.
Published: (2022)

On k-convex polygons
by: Aichholzer, Oswin, et al.
Published: (2014)

Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes,...
by: Demaine, Erik D, et al.
Published: (2020)

The computational complexity of portal and other 3D video games
by: Demaine, Erik, et al.
Published: (2021)

Computing Signed Permutations of Polygon
by: Aloupis, Greg, et al.
Published: (2012)

Continuous Flattening of All Polyhedral Manifolds using Countably Infinite Creases
by: Abel, Zachary, et al.
Published: (2022)

How to activate students’ natural desire to test themselves
by: Kalif E. Vaughn, et al.
Published: (2019-09-01)

Who Needs Crossings? Hardness of Plane Graph Rigidity
by: Abel, Zachary R, et al.
Published: (2017)

Finding a Hamiltonian Path in a Cube with Specified Turns is Hard
by: Abel, Zachary Ryan, et al.
Published: (2014)

Mario Kart Is Hard
by: Waingarten, Erik, et al.
Published: (2017)

Closed quasigeodesics, escaping from polygons, and conflict-free graph coloring
by: Hesterberg, Adam Classen
Published: (2018)

Folding equilateral plane graphs
by: Abel, Zachary R., et al.
Published: (2020)

Reconfiguring Undirected Paths
by: Demaine, Erik D, et al.
Published: (2021)

Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms
by: Tyagi, Nirvan, et al.
Published: (2018)

Who witnesses the witness? Finding witnesses in the witness is hard and sometimes impossible
by: Abel, Zachary R, et al.
Published: (2020)

Folding equilateral plane graphs
by: Abel, Zachary Ryan, et al.
Published: (2012)

Cutting polygons and a problem on illumination of stages.
by: Contreras, Felipe.
Published: (2009)

Toward a general complexity theory of motion planning: Characterizing which gadgets make games hard
by: Demaine, Erik D, et al.
Published: (2020)

Push-Pull Block Puzzles are Hard
by: Demaine, Erik D, et al.
Published: (2019)

Finding closed quasigeodesics on convex polyhedra
by: Demaine, Erik D, et al.
Published: (2021)

Varying Numbers and Locations of Cutting Points for Polygon Turning
by: Yu-Heng Chen, et al.
Published: (2010)

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
by: Abel, Zachary R, et al.
Published: (2020)

Tatamibari is NP-complete
by: Adler, Aviv, et al.
Published: (2021)

Even 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard
by: Bosboom, Jeffrey William, et al.
Published: (2019)

Energy-Efficient Algorithms
by: Demaine, Erik D, et al.
Published: (2017)

Dissection with the Fewest Pieces is Hard, Even to Approximate
by: Manurangsi, Pasin, et al.
Published: (2018)

Optimum Design of Effective Parameters for Orthotropic Plates with Polygonal Cut-Out
by: Mohammad Jafari, et al.

A simple polygon-polygon basis method to compare categorical raster maps
by: Ordóñez Celestino, et al.
Published: (2009-04-01)

Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
by: Demaine, Erik D., et al.
Published: (2015)

Bumpy pyramid folding
by: Abel, Zachary Ryan, et al.
Published: (2015)

Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
by: Williams, Virginia Vassilevska, et al.
Published: (2021)

Three Colors Suffice: Conflict-Free Coloring of Planar Graphs
by: Abel, Zachary, et al.
Published: (2018)

Existence and hardness of conveyor belts
by: Demaine, Erik D, et al.
Published: (2020)

Cannot write session to /tmp/vufind_sessions/sess_nd74nce6isfcst4eogs9sqggb0