Abstract
An algorithm to assemble large jigsaw puzzles using curve matching and combinatorial optimization techniques is presented. The pieces are photographed one by one and then the assembly algorithm, which uses only the puzzle piece shape information, is applied. The algorithm was experimented successfully in the assembly of 104-piece puzzles with many almost similar pieces. It was also extended to solve an intermixed puzzle assembly problem and has successfully solved a 208-piece puzzle consisting of two intermixed 104-piece puzzles. Previous results solved puzzles with about 10 pieces, which were substantially different in shape.
| Original language | English |
|---|---|
| Pages (from-to) | 51-64 |
| Number of pages | 14 |
| Journal | Annals of Operations Research |
| Volume | 12 |
| Issue number | 1 |
| DOIs | |
| State | Published - Dec 1988 |
| Externally published | Yes |
Keywords
- 2-D shape
- Computer vision
- assignment
- curve matching
- jigsaw puzzle assembly
- pattern recognition
- traveling salesman