×

On the mathematical formulation of the problem of reassembling fragmented objects: two new theorems. (English) Zbl 1207.49009

Summary: In this paper two new theorems are proved in association with the problem of matching three dimensional solid bodies. Rigorous mathematical criteria are given in order to test if two such bodies actually match in a certain position. Since this problem finds important application to the actual problem of reassembling fragmented objects e.g. archaeological, special care is taken to account for small gaps between matching fragments and fuzziness of the matching parameters.

MSC:

49J40 Variational inequalities
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Mitrinovic, D.S., Pecaric, J.E., Fink, A.M.: Inequalities Involving Functions and Their Integrals and Derivatives. Kluwer Academic, Dordrecht (1991)
[2] Papaioannou, G., Karabassi, E.-A., Theoharis, T.: Reconstruction of three-dimensional objects through matching of their parts. IEEE Trans. PAMI 24(1), 114–124 (2002)
[3] Shogo, Y., Shohei, K., Satoshi, K., Hidenori, I.: An earthenware reconstruction method based on the matching of both contour curve and color pattern on the surface of potsherds. J. Inst. Image Electron. Eng. Jpn. 34(2), 126–133 (2002)
[4] Ucoluk, G., Toroslu, I.H.: Automatic reconstruction of 3d surface objects. J. Appl. Math. Comput. Elsevier Comput. Graphics 23, 573–582 (2002)
[5] Willis, A., Orriols, X., Coopers, D.B.: Accurately estimating shred 3d surface geometry with application to pot reconstruction. In: Proceedings on Computer Vision and Pattern Recognition, pp. 1–7 (2003)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.