The computer modelling of gluing flat images algorithms

Abstract

In this paper one of the important tasks of moderncomputer geometry is considered: creating effective algorithms forgluing different flat images of the same object. Images areobtained by central projection from different points of view. Weuse numerical simulation for comparison of three known algorithmsfor gluing—simple linear algorithm, normalized linear algorithmand direct algorithm. In each case stability to perturbations ofthe initial data and speed of calculations were estimated.The results confirm hypothesis of G.V. Nosovskií and E.S.Skripka that the direct algorithm proposed in their work [Errorestimation for the direct algorithm of projective mappingcalculation in multiple view geometry, Proceedings of theConference "Contemporary Geometry and Related Topics'', Belgrade,Serbia-Montenegro, June 26–July 2, 2005, Faculty of Mathematics,University of Belgrade, 2006, pp.~399–408] is the most accurateand fast one.