A Multi-Scale Method for the Re-Assembly of Fragmented Objects
Helena Cristina da Gama, Jorge Stolfi · 2000
We describe here an efficient algorithm for re-assembling one or more unknown objects that have been broken or torn into a large number of irregular fragments—a problem that often arises in achaeology, art restoration, forensics, and other disciplines. The algorithm compares the curvatureencoded fragment outlines, using a modified dynamic programming sequencematching algorithm, at progressively increasing scales of resolution. The total cost gets reduced from (where is the mean number of samples per fragment) to about ; which, in principle, allows the method to be used for problems of practical size ( to fragments, to samples). The performance of the algorithm is illustrated with an artificial but realistic example.