Convex Partition Jigsaw Puzzle Solving

Jigsaw puzzle solving, relevant to fields like archaeology and biology, involves placing unsorted pieces back into their original positions. This problem is NP-complete, requiring heuristics to avoid combinatorial explosion. In this work, we focus on Convex Partition puzzles, a subspace where all pieces are convex polygons. We introduce a solver and provide a detailed explanation of the generative process for these puzzles, allowing for formal analysis and real-world applicability.

Demos

TBD

Code / Data

• GitHub repo for Convex Partition enumeration
• GitHub repo for the spring-mass system (part of the solver)
• GitHub repo for the solver

Papers

• TBD

Acknowledgments

TBD