<p>If the pieces are fairly close to where they were, <a href="https://en.wikipedia.org/wiki/Iterative_closest_point" rel="nofollow noreferrer">ICP</a> could be of help (under the assumption that the pieces are planar polygons).</p>

CC BY-SA 4.0
2018-11-20T14:56:15.093Z
thanks 
I would be interested in obtaining the adjacencies in text, the graphic part is not so impresindible
information
CC BY-SA 4.0
2018-11-20T15:01:40.720Z
your answer is good that interesting the graphic part
information
CC BY-SA 4.0
2018-11-20T14:33:17.420Z
2018-11-20T14:33:17.420Z
beyond
<p>What algorithm can I use to reassemble a broken image?
<a href="https://i.sstatic.net/Wmwt6.png" rel="nofollow noreferrer"><img src="https://i.sstatic.net/Wmwt6.png" alt="enter image description here"></a></p>

<p>Is there any technique? algorithm? Can I use graphs? machine learning? computer graphics?</p>

CC BY-SA 4.0
2018-11-21T08:47:53.947Z
Are rotations also involved? Further, is it like a jigsaw puzzle or can there also be overlap (e.g. image stitching for panoramas)?
Simon F
CC BY-SA 4.0
2018-11-21T15:33:24.663Z
@SimonF 
If we assume each part as a vertex, I need to know the adjacencies of each vertex
information
<image>
What algorithm to reassemble a broken image?
information
# What algorithm to reassemble a broken image?

(Asked by: username_0 on 2018-11-20)

What algorithm can I use to reassemble a broken image?
[![enter image description here](https://i.sstatic.net/Wmwt6.png)](https://i.sstatic.net/Wmwt6.png)

Is there any technique? algorithm? Can I use graphs? machine learning? computer graphics?

**Tags:** image

> **Comments:**
> **username_1**: Are rotations also involved? Further, is it like a jigsaw puzzle or can there also be overlap (e.g. image stitching for panoramas)?  
> **username_0**: @username_1  If we assume each part as a vertex, I need to know the adjacencies of each vertex  

---

## 1 answers

### Answer by username_2 on 2018-11-20. Score: 3

If the pieces are fairly close to where they were, [ICP](https://en.wikipedia.org/wiki/Iterative_closest_point) could be of help (under the assumption that the pieces are planar polygons).

> **Comments:**
> **username_0**: thanks  I would be interested in obtaining the adjacencies in text, the graphic part is not so impresindible  
> **username_0**: your answer is good that interesting the graphic part  

---

