Solving Convex Partition Visual Jigsaw Puzzles
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914141031104512 |
|---|---|
| author | Ohayon, Yaniv Shahar, Ofir Itzhak Ben-Shahar, Ohad |
| author_facet | Ohayon, Yaniv Shahar, Ofir Itzhak Ben-Shahar, Ohad |
| contents | Jigsaw puzzle solving requires the rearrangement of unordered pieces into their original pose in order to reconstruct a coherent whole, often an image, and is known to be an intractable problem. While the possible impact of automatic puzzle solvers can be disruptive in various application domains, most of the literature has focused on developing solvers for square jigsaw puzzles, severely limiting their practical use. In this work, we significantly expand the types of puzzles handled computationally, focusing on what is known as Convex Partitions, a major subset of polygonal puzzles whose pieces are convex. We utilize both geometrical and pictorial compatibilities, introduce a greedy solver, and report several performance measures next to the first benchmark dataset of such puzzles. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_04450 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Solving Convex Partition Visual Jigsaw Puzzles Ohayon, Yaniv Shahar, Ofir Itzhak Ben-Shahar, Ohad Computer Vision and Pattern Recognition Jigsaw puzzle solving requires the rearrangement of unordered pieces into their original pose in order to reconstruct a coherent whole, often an image, and is known to be an intractable problem. While the possible impact of automatic puzzle solvers can be disruptive in various application domains, most of the literature has focused on developing solvers for square jigsaw puzzles, severely limiting their practical use. In this work, we significantly expand the types of puzzles handled computationally, focusing on what is known as Convex Partitions, a major subset of polygonal puzzles whose pieces are convex. We utilize both geometrical and pictorial compatibilities, introduce a greedy solver, and report several performance measures next to the first benchmark dataset of such puzzles. |
| title | Solving Convex Partition Visual Jigsaw Puzzles |
| topic | Computer Vision and Pattern Recognition |
| url | https://arxiv.org/abs/2511.04450 |