“…A set of merger procedures is defined by integrated problem, which is solved. In particular, in [21,22] have already been proposed merger effective procedures for problems such as the "convex hull", "triangulation", "Voronoi Proceedings of Applications of Computer and Information Sciences to Nature Research 2010 ACISNR 2010, May 5-7, 2010, Fredonia, New York, USA ACM Conference ID 2010-12980 diagram", "all nearest neighbours" and others. It should be noted here that the central place occupied by the merger procedures the Voronoi diagram and convex hull, and technique of their construction, because they are used to create procedures for mergers of other important geometric and applied problems solved by the proposed approach.…”