Lazy caterer jigsaw puzzles: Models, properties, and a mechanical system-based solver

Peleg Harel, Ohad Ben-Shahar

Research output: Working paper/PreprintPreprint

Abstract

Jigsaw puzzle solving, the problem of constructing a coherent whole from a set of non-overlapping unordered fragments, is fundamental to numerous applications, and yet most of the literature has focused thus far on less realistic puzzles whose pieces are identical squares. Here we formalize a new type of jigsaw puzzle where the pieces are general convex polygons generated by cutting through a global polygonal shape with an arbitrary number of straight cuts, a generation model inspired by the celebrated Lazy caterer's sequence. We analyze the theoretical properties of such puzzles, including the inherent challenges in solving them once pieces are contaminated with geometrical noise. To cope with such difficulties and obtain tractable solutions, we abstract the problem as a multi-body spring-mass dynamical system endowed with hierarchical loop constraints and a layered reconstruction process. We define evaluation metrics and present experimental results to indicate that such puzzles are solvable completely automatically.
Original languageEnglish GB
PublisherarXiv preprint:2008.07644
StatePublished - 2020

Fingerprint

Dive into the research topics of 'Lazy caterer jigsaw puzzles: Models, properties, and a mechanical system-based solver'. Together they form a unique fingerprint.

Cite this