International Journal of Robotics Research
Solving jigsaw puzzles by computer
Annals of Operations Research
IEEE Transactions on Pattern Analysis and Machine Intelligence
Solving the jigsaw puzzle problem in linear time
Applied Artificial Intelligence
Optismoothing: an optimization-driven approach to mesh smoothing
Finite Elements in Analysis and Design - Special issue—Robert J. Melosh medal competition
Jigsaw Puzzle Solving Using Approximate String Matching and Best-First Search
CAIP '93 Proceedings of the 5th International Conference on Computer Analysis of Images and Patterns
MMBIA '00 Proceedings of the IEEE Workshop on Mathematical Methods in Biomedical Image Analysis
Determining molecular conformation from distance or density data
Determining molecular conformation from distance or density data
A puzzle solver and its application in speech descrambling
CEA'07 Proceedings of the 2007 annual Conference on International Conference on Computer Engineering and Applications
Automated solutions to incomplete jigsaw puzzles
Artificial Intelligence Review
A recovery system of broken relics using least squares fitting and vector similarity techniques
Expert Systems with Applications: An International Journal
A new technique for solving puzzles
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
Making burr puzzles from 3D models
ACM SIGGRAPH 2011 papers
An expert system for recovering broken relics using 3-d information
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Recursive interlocking puzzles
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
A texture based approach to reconstruction of archaeological finds
VAST'05 Proceedings of the 6th International conference on Virtual Reality, Archaeology and Intelligent Cultural Heritage
Automatic reconstruction of two-dimensional broken objects
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories
Hi-index | 0.00 |
We present a new algorithm for automatically solving jigsaw puzzles by shape alone. The algorithm can solve more difficult puzzles than could be solved before, without the use of backtracking or branch-and-bound. The algorithm can handle puzzles in which pieces border more than four neighbors, and puzzles with as many as 200 pieces. Our overall strategy follows that of previous algorithms but applies a number of new ideas, such as robust fiducial points, "highest- confidence-first" search, and frequent global reoptimization of partial solutions.