Abstract
Matching fragmented archaeological parts has always puzzled archaeologists. Very few attempts have been made so far for the automation of this procedure and thus assisting scholars to this effect. In this paper an innovative method for the detection of conjugate fragments is proposed, which is based mainly on their geometry. The Fragmatch algorithm developed for that purpose is presented, together with an extensive analysis of both of its parts; the global and the partial matching of surfaces. The method proposed is based on the comparison of vectors and surfaces, performed linearly, for simplicity and speed. It addresses mainly fragments of relatively big architectural pieces. A series of simulations have been performed in order to test the limits of the algorithm for the noise and the accuracy of scanning, for the number of scan points, as well as for the wear of the surfaces and the diversity of shapes. Problems that have been encountered during the application of these examples are interpreted and ways of dealing with them are being proposed. In addition a practical application is presented to test the algorithm in real conditions. Finally, the key points of this effort are being mentioned, followed by an analysis of the advantages and disadvantages of the proposed Fragmatch algorithm along with proposals for future work.
Get full access to this article
View all access options for this article.