We present a method for automatically solving apictorial jigsaw puzzles that is based on an extension of the method of differential invariant signatures. Our algorithms are designed to solve challenging puzzles, without having to impose any restrictive assumptions on the shape of the puzzle, the shapes of the individual pieces, or their intrinsic arrangement. As a demonstration, the method was successfully used to solve two commercially available puzzles. Finally we perform some preliminary investigations into scalability of the algorithm for even larger puzzles.
Bibliographical noteFunding Information:
Supported in part by NSF Grant DMS 08-07317.
- Bivertex arc
- Euclidean signature
- Jigsaw puzzle
- Piece fitting
- Piece locking