We know of only one other automatic jigsaw puzzle solver that can handle large puzzles: the algorithm given by Wolfson et al. [21]. Our algorithm follows the same overall approach as that of Wolfson et al., that is, first solving the border and then filling in interior “pockets”, but our algorithm differs in many
substeps.
We make more use of global geometry, for example, at all times maintaining a geometric embedding of the best partial solution; whereas Wolfson et al. [21] use only local geometry, the pairwise matching of sides of pieces.